- draw the avl tree resulting from the insertion of an entry with key into the avl tree of figure - draw the avl tree resulting from the removal of the entry with key from the avl tree of figure - explain why performing rotation in an -node binary tree represented using an array list takes ohm(ntime - is the search tree of figure ( , treewhy or why notr- an alternative way of performing split at node in ( , tree is to partition into and ''with being -node and ' -node which of the keys or do we store at ' parent in this casewhyr- dr amongus claims that ( , tree storing set of entries will always have the same structureregardless of the order in which the entries are inserted show that he is wrong - draw four different red-black trees that correspond to the same ( , tree - consider the set of keys { , , , , , , , , , , , , , , draw ( , tree storing as its keys using the fewest number of nodes draw ( , tree storing as its keys using the maximum number of nodes