Please follow the instrction and do what it asked

No code needed

$1.$ Draw the resulting $2-3$ tree from the following series of insertions: $90,45,62,74,16,3,86,94,22,60,72,31,88.$

$2.$ Delete the node containing $62$ from the tree you have built in question $1$ and draw the resulting tree. Explain the algorithm$$s process to replace that node.

$3.$ What is the efficiency of finding the maximum, minimum, and middle elements in a $2-3$ tree? Briefly explain why. Will the middle element $($or elements$)$ always be found in the root node?

$4.$ Does inserting an element and then immediately deleting it always result in the original tree $($before the element was inserted$)?$ Explain why or why not.