Q5

Problem 5. Code the function sieve (n), where n is an integer greater than 1 , which computes and returns the list of all the prime numbers that are less than or equal to n using the sieve of Eratosthenes algorithm. Problem 6. Code the function gcd(a,b) which computes and returns the greatest common divisor of the given positive integers a and b using Euclid's algorithm. (6.1) Implement the function non-recursively using a loop statement. (6.2) Implement the function using recursion (no loop statements). Note: For Problems 5-6, you may provide the code in Python or C