Please insert the following keys in the given order into an empty B$+$tree of class with degree $5$ : maximum number

of children for a node $5$ and minimum number of keys in a non$-$root node $2.$

$2,6,17,20,24,25,27,29,30,31,32,5,21,1,40,45,50,70$

a$)$ Draw the tree before the first and all consecutive split operation

b$)$ Delete the following keys $25,6,5,$ and $20.$ Draw the tree after each deletion.