Problem 1. (Euclids Algorithm) Write a program gcd.py that takes two integers x and y as command-line arguments and writes their greatest common divisor (gcd) computed using Euclids Algorithm: if y divides x, the gcd of x and y is y; otherwise, the gcd of x and y is the same as the gcd of y and x mod y.

$ python3 gcd.py 54 24 6

$ python3 gcd.py 22 45 1

Problem 2. (Counting Primes) Write a program prime_counter.py that takes an integer N as command-line argument and

writes the number of primes less than or equal to N. Note that if you are not careful about the upper bound of the loop that

tests for the primality of a number, your program may not finish in a reasonable amount of time. Hint: a number i is prime

if it is not divisible by any number j [2, (i)^1/2). $ python3 prime_counter.py 1000 168