$1.$ Trace the path that would be followed in searching for a node containing $79.$

$2.$ Trace the path that would be followed in searching for a node containing $27.$

$3.$ What is the maximum height of a binary search tree containing these nodes $($i$.$e$.,$ nodes of

the original tree, not including $79$ and $27)?$ Draw such a tree.

$4.$ What is the minimum height of a binary search tree containing these nodes $($i$.$e$.,$ nodes of

the original tree, not including $79$ and $27)?$ Draw such a tree.

$5.$ Consider the original tree shown above. Show how this tree would look after the insertion

of nodes $63,77,76,48,$ and $10,$ in this order

give answers for above question for Tree B