Part c. [2 points] Give the best Big- 0 characterization for each of the following running time estimates (where n is the size of the invut problem). Part d. [ 3 points] The following AVL tree of integer keys is given. Execute the following insertion and deletion calls on this tree. Show all rotations that apply. (i) Apply delete(28) on the given tree (ii) Apply delete(6) on the resulting tree from (i) (iii) Apply insert(17) on the resulting tree from (ii)