$2.$ B$+-$tree

A PARTS file with Part# as the key field includes records with the following Part# values: $46,15,25,9,80,70,60,32,74,$

$49,87,5$ and $37.$ Suppose that the search field values are inserted in the given order in a B$+-$tree of order p $=3$ and pleaf $=2$

$($a$)$ Show how the tree will expand after each inserted value and what the final tree will look like.

$($b$)$ Delete the following values: $5,70,46,49,9,15,$ and $25.$ Show how the tree will shrink after each deleted value $($in the

given order$)$ on and show the final tree.