2. Max-Min Problem: find the maximum and the minimum numbers of a sequence number in a divide-and-conquer manner. (Let n be the size of the sequence. For simplicity, assume that n- 2*.) (1) (40 points) How to do it? Please write the pseudo-code of your algorithm. (2) (20 points) What is time complexity of your algorithm? Please present the corresponding deriving process. 2. Max-Min Problem: find the maximum and the minimum numbers of a sequence number in a divide-and-conquer manner. (Let n be the size of the sequence. For simplicity, assume that n- 2*.) (1) (40 points) How to do it? Please write the pseudo-code of your algorithm. (2) (20 points) What is time complexity of your algorithm? Please present the corresponding deriving process