In this exercise, the students learn how to implement reduction modulo special form numbers. They should write a small C code to compute the residue of a = 230 - 18 = 1073741806 = {0x3FFFFFEE} over the following numbers without using modulo (%) operator. Please provide a brief summary of your work with your code. (Remark: Since all the numbers in this exercise need less than 32-bits to allocate, you can simply dene them using intdata type). (a) p1 = 217 - 1 = {0x1FFFF} (Mersenne prime) (b) p2 = 226 - 5 = {0x3FFFFFB} (Pseudo-mersenne prime) (c) b = 216 = {0x10000} (Not a prime number)