4. We have a linked list in which each element contains an integer value and a pointer to the next node of the list. (Note: Unlike our sorting examples involving arrays, here accessing any internal element requires traversing all preceding elements.) We want to use the divide-and- conquer technique to design an algorithm for finding the maximum value in the list. Assume that the number of nodes n in the list is 2 for some positive integer r. (a) Indicate the actions performed during the divide, conquer and combine steps of the algorithm (b) Specify the algorithm in the form of pseudo-code. (c) Give the recurrence for T(n), the running time of the algorithm when the list is of size n. Explain how you arrived at the recurrence, i.e. costs for the divide, conquer, combine steps (d) Solve the recurrence by the substitution method and find the expression for T(n). How does it compare to an incremental solution for the same