Insert the following numbers into a B tree: (assume order 3 in the tree)

36, 27, 19, 23, 16, 12, 9, 21, 22

Insert the following numbers into a B+tree: (assume order 3 in the tree for both leaf and internal nodes)

36, 27, 19, 23, 16, 12, 9, 21, 22

For linear hashing, with a blocking factor of 2 and an initial file size of two blocks; show how the file will grow as the following values are inserted:

36, 27, 19, 23, 16, 12, 9, 21, 22

Outline, in pseudo-code an algorithm for deletion from a linearly hashed file.