Consider the following algorithms. For each one, give (with brief justification) a recurrence for the algorithm's worst-case runtime T(n) as a function of the input length n, and state whether the Master Theorem applies to it. If so, derive a closed-form asymptotic expression for T(n) using the Master Theorem. If not, explain why not. (l (c) \begin{tabular}{|ll|} \hline Require: nn array ( matrix )A of real numbers \\ 1: function FOO(A[1,,n][1,,n]) \\ 2: if n=1 then \\ 3: & return A[1][1] \\ 4: & d0 \\ 5: & Let B be the (n1)n array obtained by deleting the row 1 from A \\ 6: & for j=1,,n do \\ 7: & Let C be the (n1)(n1) array obtained by deleting column j from B \\ 8: & dd+(1)j1A[1][j] Foo (C) \\ 9: & return d \\ \hline \end{tabular}