Design a decrease-by-half algorithm that solves the problem; describe your algorithm with clear pseudocode, and prove the time efficiency class of your algorithm.

def minmax(L):

....

return (l,g)

(a) min and mar input: a list L of n > 0 comparable objects output: a pair (l,g) where l and g are the least and greatest elements in L, respec- tively Hint: An optimal algorithm for this problem has time complexity O(n)