1. [4] answer questions for the following algorithms: foo(int[] a, int I, h, t) { int x; if (1 >h) return FALSE; x = (1+h)/2; if (t == a[x]) return TRUE; if (t a[x]) foo (a, x+1, h, t); } Q. [2] Show the recurrence relation of the time function T(n) for the above recurrence algorithm. Q. [1] Use a master method to solve the T(n). You need to show clear steps to justify your answers. Q. [1] Explain what this algorithm is about