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 order. What will be

the root of the constructed B+ tree if the number of pointers that will fit in one node is six?

(A) 7, 11 (B) 7, 19 (C) 19 (D) 11

Ans is B)....

Please provide some hint for solving this question