8. Write a recursive algorithm to find the maximum of a finite sequence of numbers. 9. For the following algorithm find the theta notation for the number of time- x=x+1 is executed. i=n while (i>= 1) { for j=1 to n { x=x+1 } i=1] }