The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is the maximum number of pointers that can be stored in it. The B+ tree initially empty.
2, 7, 3, 11, 17, 5, 19, 31, 29, 23
The sum of key values which responsible of leaf node split up as a result of these insertion is ________. (Assume right baising)
Please Verify my solution :-