Let A[1n] be an array consisting of n distinct numbers. Develop a divide-and-conquer algorithm to find the largest number among the elements of A. (a) Write down the pseudo-code for your algorithm. (b) Define T(n) as the running time of your algorithm on an input of size n. Find a recursive formula for T(n), i.e., write T(n) in terms of T(k) for some 1k<.>