Discrete structures

Write pseudocode using divide-and-conquer algorithm to describe the procedure searching for the largest difference in a sequence obtained by subtracting an integer in the list from the one following it. The algorithm takes a sequence of n integers a_1, a_2, ..., a_n as input, and output the largest difference. Express the recurrence relation for the number of comparison operations in the above algorithm, f(n), and construct a big-O estimate for the number of comparison operations used Let f be an increasing function that satisfies the recurrence relation. f(n) = a f(n/b) + cn^d whenever n = b^k, where k is a positive integer, a greaterthanorequalto 1, b is an integer greater than 1, and c and d are real numbers with c positive and d nonnegative. Then f(n) is {O(n^d) if a b^d