Write a Python function called sieve of E sum that takes an integer argument N and uses the Sieve of Eratosthenes to return a tuple of both the number of primes less than or equal to N as well as the sum of all primes less than or equal to N (in that order). Example: sieve-ot_r_sum(10)-(4, 17) Example: sieve of E sum(100000) - (9592, 45396537) This problem has a timeout limit of 1 second and a memory usage limit of 1MB, so be sure to write semi-efficient codel The values of N in each test-case satisfy 2 s N s 1000000. For example: Result Test