Follow the B-TREE-INSERT procedure described in Chapter 18, show step-by-step output of each of the following operations applied on the B-tree below. Note that the B-tee has a minimum degree t=3 and the values inside each node show the key values stored in that node.

a) Insert key 13.

2. Based on output from step a), insert key 37.
3. Based on output from step b), insert key 34.
4. Based on output from step c), insert key 49.

10, 20, 30 40 1 3 5 8 12 15 22 27 32 33 35 38 41 42 43 46 47