please answer the question i have summited the question many times but keep having having just opinions and not solutions

Q1. [30] Min-Max recursive algorithm 1) [10] 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. 2) [20] Implement your algorithm of Q1.(1) in Python, returning a pair of the maximum and the minimum elements. Run your algorithm in the following inputs. A) [30, 50, 20, 70, 10, 80, 25, 100, 60,40). B) [84, 64, 24, 14, 54, 34, 4, 44, 74]