Question $1$

a$)$ Construct a B$+$ Tree of Order P$=4$ For the following set of key values, make sure to insert these key values in order as given below $($i$.$e$.$ insert $11,$ then insert $21,$ then insert $16,$ and so on$)$: $11,21,16,23,6,31,26,18,42,44,13,55,37$ Show only the final constructed B$+$ tree after inserting all the above keys. b$)$ After you construct the tree in part $($a$)$ above, show this B$+$ tree after the following keys $($insert $36,$ insert $57,$ then insert $66)$ are inserted in the given order. Show only the final constructed B$+$ tree after all these insertions. c$)$ After you finish inserting the keys of part $($b$),$ show this B$+$ tree after the following keys in the given order are deleted $($delete $18,$ then delete $16,$ then delete $36).$ Show only the final B$+$ tree after all these deletions.