Consider the following B+ tree (no duplicates). Start with the original tree index for each question part. Apply the action(s) asked and SHOW the resulting tree. In the case of a split, "push right" the extra value (3 values split1 into 1 and 2, with the 2 values placed in the right node). Node P1 is the root of the tree.

Insert 42* into the original tree. Indicate changes in a different color.
How many I/O reads are performed and on which pages: