Question $2$:

Construct a $B+$ tree of order $n=3$ for the following search key values inserted in the given

order: $9,5,11,15,39,29,22,30,4,27,8,52.$ Each time there is a split, a new B$+$ tree

must be drawn.

Question $3$:

Construct a $B+$ tree of order $n=4$ for the following search key values inserted in the given

order: $9,5,11,15,39,29,22,30,4,27,8,52.$ Each time there is a split, a new B$+$ tree

must be drawn.