The following key values are placed in the sequence indicated below into a B tree with internal node order of 3 and a leaf node order of 2. The order of internal nodes represents the maximum number of tree pointers that can be stored in each node, whereas the order of leaf nodes represents the maximum number of data items that can be put in it. The B-tree is initially empty

12, 3, 6, 8, 4, 2, 1

The maximum number of times leaf nodes would get split up as a result of these insertions is