Assume two trees, a Max Heap and a Binary Search Tree.

For the questions below, answer with letters A for heap, B for BST$,$ or C for neither.

$1.$ If n number of elements were inserted into both trees, is there a tree that is more likely to have a

shorter height than the other tree? If so$,$ answer A or B$.$ If not, answer C$.$

$2.$ Would one tree have a more efficient average case runtime for inserting a new Node into the tree

than the other tree? If so$,$ answer A or B$.$ If not, answer C$.$

$3.$ Both a heap and a BST can be used to sort an array by inserting the array$$s elements into either

tree. Would one tree have a more efficient worst case runtime when used to sort a given array

than the other tree? If so$,$ answer A or B$.$ If not, answer C$.$

$4.$ Do the properties of one tree make it easier to determine whether the tree contains a specific

value than doing the same in the other tree? If so$,$ answer A or B$.$ If not, answer C$.$