Click and drag statements to make a recursive algorithm for finding the maximum of a finite set of integers, making use of the fact that the maximum of n integers is the larger of the last integer in the list and the maximum of the first n 1 integers in the list.

Click and drag statements to make a recursive algorithm for finding the maximum of a finite set of integers, making use of the fact that the maximum of integers is the larger of the last integer in the list and the maximum of the first n-1 integers in the list. if n the return an if n 1 then return al else return procedure (a1.01. ...,am: integers) else else return Tana (ai,o2, ...,am) m mura (a1, a2, ...,an-1) ir m an then return m