Consider the following algorithm non recursive algorithm! ALGORITHM ADA (A[0.n-1,0.n]) for j0 to n1 do for j+i+2 to n2 do for ki to n do A[j,k]A[j,k]A[j,d] a) what is the basic operation of the algorithm? b) How many times basic operation is executed? c) Find the time efficiency class of this algorithm. 2) Consider the following recursive algorithm. ALGORITHM Q(m) Winput: A positive integer m if m=1 return 1 else return Q(m1)+2m1 a) Set up a recurrence relation for this function s values and solve it to determine what this algorithm computes. b) Set up a recurrence relation for the number of muttiplications made by this algorithm and solve it