18. When a divide-and-conquer algorithm divides an instance of size n of a problem into subinstances each of size n/c, the recurrence relation is typically given by T (n) = aT (2) + g (n) T1)-d for n > 1 c. where g (n) is the cost of the dividing and combining processes, and d is a constant. Let n (a) Show that (b) Solve the recurrence relation given that g(n) (n)