Set up a recurrance relation for the above code

SHOW WORK

5. 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)