Discrete structure

ASAP

Set up a recurrence relation for the previous algorithm, and construct a big-O estimate for the number of comparison operations needed. Let f be an increasing function that satisfies the recurrence relation f(n) = af(n/b)+c whenever n is divisible by b, where a greaterthanorequalto l, b is an integer greater than 1, and c is a positive real number. Then f(n) is {O(n^log_b^a) if a > 1, O(log n) if a = 1