$(5)$ Consider a B$+$ Tree of order $(m=3).$ Thus number of keys in each node is $m-1=2.$ Assum$-$

ing lexicographic ordering, show the results of entering one by one the keys that are three

letter strings: $($era$,$ ban, bat, kin, day, log$,$ rye, max, won, ace, ado, bug, cop, gas, let, fax $)($in

that order$)$ to an initially empty B$+$ tree. Show the state of the tree after every $3$rd insertion.

$(6)$ Do above activity for B Tree. Show the state of final tree.