only solve d

Input: List A=(a1,,aN) such that N1 Output: value x fo(A) if length (A)==1 return a1 A=(a1,,aN1) q=fo(A) if (q>aN) return q else return aN State what problem this algorithm solves and write down the two recurrence equations that characterise this recursive algorithm. (c) Define what is meant by the term "topological sort" when applied to a Directed Acyclic Graph (DAG). (d) Enumerate all possible topological sorts for the DAG shown below