For each of the following divide - and - conquer algorithms, use the Master Theorem to determine the algorithm’ s worst - case order of growth in terms of Theta ( · ) . What is a worst - case input to the algorithm? What is the best - case complexity of each algorithm, and what is a best - case input? Note: the notation A [ i . . j ] means " the subarray of A with first index i and last index j . "