Q5. (a) Write a recursive function that finds the sum of integers 1 to n. (10P) (b) Calculate the running time of the function you wrote. (10P)

Q5. (a) Write a recursive function that finds the sum of integers 1 to n. (10P) (b) Calculate the running time of the function you wrote. (10P) Q1. a) Run the following algorithm for input A=. What is A when the algorithm terminates. Show each iteration (10P) b) Find the running time of the algorithm in O[big 0) notation. (5P) Algorithm(A, 1, n) for i = 1 to n - 1 for j = n down to i +1 if A[j] > A[j - 1] exchange A[j] with A[j - 1] Q6. In the following algorithm, the parameter x is the root of a binary search tree. What does the following algorithm do in the following BST? Explain what it does? (10) 1. y = TreeMin (x) 2. print key [y] = TreeMax (x) 4. while key [y]