Algorithm Analysis recursive function analize

take 4 parameters; A is an array of n integers, i and j are array indices such that i j , and k is an integer. first call to the algorithm is ALG(A, 0,n-1,10).

What does the algorith return? Give a tight upper-bound on the asymptotic time complexity of the algorithm.

I would be very grateful if you could explain it step by step.

Alg(A, i, j, k) { myInt and myResult are integers; if (i > j) return 0; if (i == j) { if (A[i] == k) return 1; else return 0; } else { my Int = Li + j)/2]; my Result = Alg(A, i, myint, k) + FancyAlg(A, myint + 1, j, k); while(i