Treat your ouid number as a decimal integer. a) find its representation in base 26 (a = 0, b=1, z = 25) b) multiply the result of 1) by dallas, and output the product in base 26 c) divide the result of 2) by okc, and find the remainder and quotient, all in base 26. 2. read a few articles online about the great internet mersenne prime search (gimps). argue that if n is a composite integer, then 2^n - 1 must be composite. is it true that if n is a prime, then 2^n-1 must be a prime? 3. determine the number of divisors of 2^n, where n is a non negative integer.