Use the definitions of bog-O notation and little-o notation to prove that if f (x0 = o(g(x)), the must be turn that f(x) = O(g(x)). Do not use the limit theorem to prove this: you can only use the definitions of big -O and little-o notation. Describe the running time of the algorithm below as a recurrence relation, and use the Master Theorem to analyze its running time. function Excluded Middle Search (array B, int x) if length (B) = = 1; return B[0] = = x else B1 leftarrow B[0;length (B)/4] B2 leftarrow B [3 length (B)/4;length (B)] return Excluded Middle Search (B1) or Excluded Middle-Search (B2) end function.