set up a recurrance relation for the above code .

Consider the following recursive algorithm int FantasticAlg (int[] A, L, U); if (L >= U) return false; else { int m = (L+U)/2; FantasticAlg (A, L, m); FantasticAlg A, m+1, U); What would be the efficiency class of the algorithm based on the master theorem? ORAS). The master theorem is as follows T(n) = at(n/b) + f(n) where f(n) (nk), k20 If a bk, T(n) (nlogb)