Implement Euclids algorithm for finding the greatest common divisor in C or C++. Make sure your code compiles. (5pts)

(a) Your files should have the following prefix: yourLastName_yourFirstName_

(b) Implement both recursive and non-recursive version of the algorithm and provide

the two source code files via Blackboard.

(c) The two numbers should be passed as command line arguments and the result

printed out on screen. Example of running your code:

 >yourLastname_yourFirstname_GCD_recursive 60 24 12