Write a recursive algorithm in pseudocode, Min-Max, for finding both the minimum element and the maximum element in an array A of n elements. Your algorithm has to make a recursive call to itself only once and has to return a pair (a, b) where a is the minimum element and b is the maximum element; i.e. it should not invoke itself twice to find the minimum and the maximum in the separate calls. Algorithm Min-Max(A, n) Input: an Array A of n elements Output: a pair of (a, b) where a is the minimum element and b is the maximum element.