For a set consisting of distinct) integers and an elementxe S. rank(x) is defined as the number of elements in that are less than or equal to X. As an example, suppose that S = (2,3,5,7,11). then rank(5) = 3. Given a binary search tree T, design an algorithm that outputs all leaf modes along with their ranks. Analyze the running time of your algorithm. Part of the credits depend on the running time efficiency) of your algorithm. (Hint: Consider maintaining a global counter to keep track of the number of nodes you have visited in the BST.) (b) (8 points) Analysis