The input to the maximum and minimum problems is a sequence of numbers, a1 … an, where n, the length of the sequence, is a positive integer. the function length(a1 … an) returns n, the length of the sequence. if n > 1, you can also create a new sequence a1 … an-1, which is the original sequence a1 … an, with the last number an omitted. (a) give a recursive algorithm which takes as input a sequence of numbers and returns the minimum (i. e., smallest) number in the sequence. your algorithm should not use a loop. (b) give a recursive algorithm which takes as input a sequence of numbers and returns the maximum (i. e., largest) number in the sequence. your algorithm should not use a loop.