Divide and conquer, and the Master Theorem.

For each of the following recursive algorithms, give $($with brief justification$)$ a recurrence for the

algorithm's running time $T(n)$ as a function of the input array size $n.$ State whether the Master

Theorem is applicable to the recurrence, and if so$,$ use it to give the closed$-$form solution; if

not, explain why not.