QUESTION 10 If (33, 3) is a public key in RSA, then it encrypts 5 as 23. O True O False QUESTION 11 If (33, 3) is a public key in RSA, then the private key is 7. O True O False QUESTION 12 Breaking RSA is simple in theory but hard in practice when n is large. O True O False QUESTION 13 It is very expensive computationally to evaluate an mod mifa,n, and m are really large. O True O False QUESTION 14 Let m and n be two positive integers. Then, the most efficient algorithm available to find gcd(m,n) is O(logn). O True O False QUESTION 15 The is no integer solution for the equation 412 x + 260y=5. O True O False