please do it asap

c. In mathematics, the greatest common divisor (gcd) of two non-zero integers is the largest positive integer that divides each of the integers without a remainder. One way of finding the gcd of two different positive integers is to replace the largest value by the magnitude of their difference, stopping when both the numbers are the same, this final value is the GCD of the two original numbers. Write two algorithms (1) non-recursive and (2) recursive in pseudocode to output the gcd of any two different integers using the algorithm described above. Your algorithm must handle scenarios when a user enters non numeric or numbers less or equal to zero