The following is Euclids 2,300-year-old algorithm for finding the greatest common divisor of two positive integers I and J. Step Operation 1 Get two positive integers as input; call the larger value I and the smaller value J 2 Divide I by J, and call the remainder R 3 IfRisnot0,thenresetItothevalueofJ,reset JtothevalueofR,andgobacktoStep2 4 Print out the answer, which is the value of J 5 Stop a. Go through this algorithm using the input values 20 and 32. After each step of the algorithm is completed, give the values of I, J, and R. Determine the final output of the algorithm.