(1) An alternative method of performing an inorder tree walk of an n-node binary search tree finds the minimum element in the tree by calling Minimum and then making n - 1 calls to Successor. Analyze this algorithm, and show that it runs in O(n) time