I. Consider the following recursive algorithm, AddOne(A[],n), that takes as arguments an array A of n integers, and add 1 to every element in A. So for instance, if A = [1, 3, 2, 9, 5, 4], calling AddOne(A,6) should result in A = [2, 4, 3, 10, 6,5). AddOne(int Al, int n){ // you can assume that the array A is not empty... If (n ==1) A[0] = A[O]+1 else A(n-1) = A(n-1] + 1; AddOne(A, n-1) } a) Using the addition operation "+" as basic operation, and basing the counting of basic operations on n, which is the number of elements in the array, set up and solve the recurrence relationship for the number of basic operations done by the algorithm. b) Use similar approach to write a RECURSIVE algorithm that uses the reduce-and-concur approach to add all the elements in the array