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).