$1.$ Create a B$-$tree of order m $=3$ using the following key values: $(6)$

$52,70,61,59,35,56,80,50,30,57,73,55,62,54,63,58,100,60,110,92$

$2.$ Delete the key values $110$ and $59$ from this tree $(4)$

Upload two pdfs: First one that shows the created B$-$tree and second one that shows the tree with the two deleted key values.