Problem 3. Write code to find all primes p less than 200 that satisfy p=1 (mod 4). (This condition means that the remainder of p when divided by 4 equals 1. Hint: Use the mod operator.) Modify your code to count how many primes p less than one-million satisfy p = 1 (mod 4) and how many satisfy p = 3 (mod 4). (Hint: The function "prime_range" will be useful.)