Several Algorithms Exist For Solving For The Greatest Common Denominator Of 2 Positive Integers. One Algorithm Is The Consecutive Integer Checking Algorithm, Which Summarized In Slide 4. Another Algorithm For Computing The GCD Is Euclid's Alorithm, Which Is Summarized In Slide 3. Your Task This Project Is To Implement These Algorithms Using The Starting Code

Several algorithms exist for solving for the greatest common denominator of 2 positive integers. One algorithm is the Consecutive Integer Checking algorithm, which summarized in slide 4. Another algorithm for computing the GCD is Euclid's alorithm, which is summarized in slide 3. Your task this project is to implement these algorithms using the starting code provided (comments delimit the areas you should complete). Your code must do the following