Write an algorithm that accepts as its input two numbers, and returns the greatest common divisor (gcd) of those two numbers. note that this is also known as the euclid algorithm and is mentioned briefly in the lecture about algorithms. check out the link on the slides to get a better idea how this works hm since it will show up