16. Write a function int maximum (int list[], int n)

that recursively finds the largest integer between list[0] and list[n]. Assume at least one element is in the list. Test it with a main program that takes as input an integer count followed by the values. Output the original values followed by the maximum. Do not use a loop in maximum.

Output the value in the main program, not in the function.

Sample Input 5 50 30 90 20 80 Sample Output Original list: 50 30 90 20 80 Largest value: 90