2) Implement the second GCD algorithm from our text, the pseudocode of which we wrote in the practice section: ALGORITHM Consecutive (m,n) //Computes ged(m, n) by the consecutive integer checking alqorithm /IInput: - //Output: tmin(m,n) while true do //=infinite=logp if m i t=0// decision for step z if n i t=0// decision for step 3 returnt llexit point from the loop else else decrement t f/step 4 decrement t// step 4 The function will be named consecutive. Use the same variable names as in the pseudocode above. The GCD should be returned by the function, and printed in main. Test with all three combinations of m and n we used so far, and verify that you get the same GCD. This is the GCD(69,24) is 12 GCD(31415,14142) is 1