2) A list/array A contains a sequence of X's and O's. a) Write a (n) Divide and Conquer Algorithm countX (A, low, high) // low and high are the first and last index that counts and returns the number of X's. b) Write the recurrence relation for the algorithm, and solve it enough to show it's (n) c) Suppose we knew that the sequence of O's must follow the sequence of X's,and that each sequence is possibly empty (e.g. xxxxxxooo, xxo,00,xxx ), re-write the algorithm such that it is (logn). d) Write the recurrence relation, and solve it enough to show it's (logn)