I solved part a but I need help with part b.

Thank you!

When a divide-and-conquer, algorithm divides an instance of size n of a problem into sub instances each of size n/c. the recurrence relation is typically given by where g (n) is the cost of the dividing and combining processes, and d. is a constant. Let n = c^k. Show that T (c^k) =d times a^k + sigma^k _j=1 [a^k-j times g (c^j)]. Solve the recurrence relation given that g(n) Element Theta (n)