instructions :

algorithm needed in code :

In software, implement the Euclidean algorithm to find the greatest common divisor of any two positive integers. There is not a specific programming language to use. It should implement the pseudocode provided in the text. DO NOT USE A DIFFERENT ALGORITHM. Your program should allow the user to enter two integers. output the intermediate values of q, r1, r2 for each step, and return the value of the greatest common divisor. Challenge component: Allow the user's input to be zero as well as the positive integers. Provide error checking and a response if the user enters a negative integer as input. This is an individual assignment. Upload the following. 1) a file of the code 2) screenshots showing the output table for at least 4 pairs 72b; (Initialization) Pita; while (r2 > 0) { q-1/2, rF"1-9x12; ifr2; r2r; } gcd (a, b)r b. Algorithm