Consider the following recursive function:

int myfunc(int A[], int N, int x)

{

int count;

if(N<=0)

return 0;

if(A[N-1]==X)

count =1;

else

count =0;

return (myfunc(A, N-1, X) +count);

}

a) What is the run time complexity of the above function in terms of big oh (O)?

b) Write an iterative version of the above recursive function.