B TREE AND B+TREE

Create B tree and B+ tree to insert the following key values (the order of the tree is three) 32,11, 15, 13, 7, 22, 15, 44, 67, 4.

HASHING

The following key values are organized in an extendable hashing technique. 1, 3, 5, 8, 9, 12, 17, 28. Show the extendable hash structure for this file if the hash function is h(x)=x mod 8 and buckets can hold three records. Assess how the extendable hash structure changes as the result of each of the following steps: (15) INSERT 2. INSERT 24. DELETE 5. DELETE 12..