Show the result of inserting the values 1, 2, 3, 4, 5, and 6 (in that order) into the B⁺-tree of Figure 10.18. Please show what the tree looks like after each insertion.

The resulting tree should look like this.

33 18 23 48 10 12 15 18 1920 2122 23 3031 33 45 47 4850 52 Figure 10.18 Example of a Bt-tree of order four. Internal nodes must store between two and four children. For this example, the record size is assumed to be such that leaf nodes store between three and five records