Consider a $B^+$ tree , in which order of internal nodes is 4 and order of leaf nodes is 3. The order of internal nodes is the maximum number of tree pointers in each internal node and the order of leaf node is the maximum number of data items that can be stored in each node.
Keys are inserted into following order
The maximum number of times nodes would split up is?
I did in below way and I got 3 splits, assuming B+ tree with left biasing.
But the answer is given to be 8. Have I made any mistake?