1. Insert a record with search key 109 into the tree.

2. Delete the record with search key 81 from the original tree.

Exercise: Consider the B+ tree index shown in the figure below. Each intermediate node can hold up to five pointers and four key values. Each leaf can hold up to four records, and leaf nodes are doubly linked as usual, although these links are not shown in the figure. Answer the following questions. Please show every step of the insertion and explain the process. 10 20 30 80 Il 35 42 50 65 900 v 98 98 99 100 105 30- 31 68- 69 70 79 LS 36- 38 51* 52* 56- 60 94 95 96 97 L4 L7 L2 42 43 Sl 82