Please help solve this problem, Part A needs a worst case running time and an explanation on how you found it, B needs you to solve the recurrence relation to determine a function g(n) such that T(n) is O(g(n))

3. Consider the following idea for sorting a list of size n : Split the list into n lists of size n each, sort each of the smaller list, indiyidually and then merge the sorted lists to get a singe sorted list. (a) Let T(n) denote the worst, case running time of an algorithm based on this idea. Derive a recurrence relation for T(n). Proride a clear explanation of how you arrived at this recurrence. (b) Solve the recurrence relation to determine a function g(n) such that T(n) is (g(n))