Algorithms & Running Time Analysis: Describe the most time-efficient way to implement the operations listed below Given an AVL tree containing N positive integers, print out all the even values contained in the tree in descending order (e.g. 12, 8, 6, 2). Be sure to explain how you will get descending order. Explanation: a. Given a binary search tree containing N integers, create an AVL tree containing the same values. You should not destroy the original BST in the process. Explanation: b. Printing out the values stored in all of the leaves of a perfect BST containing N values in ascending order. Explanation: c. d. Printing out all the odd values stored in a binary search tree containing N positive integers in ascending order. Explanation: Finding the minimum value in a binary search tree of size N. Explanation: Printing out the values in an AVL tree in post-order. Explanation: Insert into a Dictionary implemented with an AVL tree. e. f. g. h. Print out all leaf nodes in an AVL tree in descending order (from largest to smallest). Explanation: i. Given a binary search tree, find which value is the median value, and delete that value. Explanation: j. What is the worst-case asymptotic running time for the best algorithm for finding and deleting the maximum element in an AVL tree? What is the worst-case asymptotic running time for the best algorithm for finding the mode (i.e. the most frequently occurring value) of the keys in a binary search tree? k