12.5 Construct a B+-tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in ascending or- der. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight Answer: The following were generated by inserting values into the B+-tree in ascending order. A node (other than the root) was never allowed to have fewer than [n/2] values/pointers. a. 511 19 29 2 3 5 7 17 19 23 29 31