Given the following B+-tree, please answer following questions. 12113411411511 53|77|83|85||86|| 1. (5 marks) What is the value of p for this B+-tree? (Note that p is the order of a B+-tree) 2. (6 marks) Can you re-build a taller B+-tree with the same value of p using the same set of search-key values in the leaf nodes of the given tree? If yes, show the steps by drawing a new diagram whenever the height of the tree increases. 3. (6 marks) Insert the search-key values 32, 84, and 19 in sequence to the given B+-tree, and draw a new diagram for each insertion. 4. (8 marks) Suggest a sequence of search-key values to be deleted from the resultant B+-tree in Q4.2 to shrink the tree to 2 levels with the least number of deletions. Show the steps by drawing a new diagram whenever a node is deleted. Activate Wi Go to Settings t