Create an application that finds the greatest common divisor of two positive integers entered by the user. Console Greatest Common Divisor FinderEnter first number: 12Enter second number: 8Greatest...

Create an application that finds the greatest common divisor of two positive integers entered by the user. Console Greatest Common Divisor Finder Enter first number: 12 Enter second number: 8 Greatest common divisor: 4 Continue? (y/n): y Enter first number: 77 Enter second number: 33 Greatest common divisor: 11 Continue? (y/n): y Enter first number: 441 Enter second number: 252 Greatest common divisor: 63 Continue? (y/n): n Specifications The formula for finding the greatest common divisor of two positive integers x and y must follow the Euclidean algorithm as follows: Subtract x from y repeatedly until y < x.="" swap="" the="" values="" of="" x="" and="" y.="" repeat="" steps="" 1="" and="" 2="" until="" x="0."  y="" is="" the="" greatest="" common="" divisor="" of="" the="" two="" numbers.="" you="" can="" use="" one="" loop="" for="" step="" 1="" of="" the="" algorithm="" nested="" within="" a="" second="" loop="" for="" step="" 3.="" assume="" that="" the="" user="" will="" enter="" valid="" integers="" for="" both="" numbers.="" the="" application="" should="" continue="" only="" if="" the="" user="" enters="" 'y'="" or="" 'y'="" to="" continue.="" note="" that="" if="" you="" do="" not="" implement="" the="" euclidean="" algorithm,="" you="" will="" fail="" this="">