2. If you are given enough time, space and computing power, which of these two would you be able to solve with confidence? For a given number n (a) Testing whether 2n + 2 is the sum of two prime numbers (10 Points) (b) Testing whether the Collatz process when begun at n eventually hits 1 (10 Points) if (n%2 == 1) { n = 3*n+1;} else { n = n/2;} i. Show the inner workings of Collatz process when n = 5 and n = 7 (5 Points) ii. What does it take to prove Collatz process will always end with 1? Can it be proven? Read here for more info - https://en.wikipedia.org/wiki/Collatz_conjecture (5 Points) 2. If you are given enough time, space and computing power, which of these two would you be able to solve with confidence? For a given number n (a) Testing whether 2n + 2 is the sum of two prime numbers (10 Points) (b) Testing whether the Collatz process when begun at n eventually hits 1 (10 Points) if (n%2 == 1) { n = 3*n+1;} else { n = n/2;} i. Show the inner workings of Collatz process when n = 5 and n = 7 (5 Points) ii. What does it take to prove Collatz process will always end with 1? Can it be proven? Read here for more info - https://en.wikipedia.org/wiki/Collatz_conjecture (5 Points)