Write an oz function which has at its input a list of integers and returns the maximum element. for example, {max [3 ~2 0 4 5 1]} should return 5. the optimal algorithm for determining the maximum element of a list with n elements is doing n-1comparisons. write an oz function which has at its input a list of integers and returns the first two maximum elements. for example, {max [3 ~2 0 4 5 1]} should return 5 and 4. what is the optimal number of comparisons needed? try to write an optimal version (for maximum mark).