QUESTION 14 Let and n be two positive integers. Then, the most efficient algorithm available to find gcd(m,n) is O(logn) True False QUESTION 15 The is no integer solution for the equation 412 x + 260y=5 True False QUESTION 16 The multiplicative inverse of 1235 mod 37 is 12. True False QUESTION 17 If fnis prime, then Faezn 10+0, an-Imodn=1 True False