QI. Using Euclidean algorithm find GCD(42, 280). Show you work. Q2. Using Extended Euclidean algorithm find the multiplicative inverse of 7 in mod 55 domain. Show your work including the table. (All rows may not be needed) i ri 91-1 t: 0 55 1 0 1 7 2 3 Si 0 1 4 5 6 Q3. Determine (2400). (Note that 1,2,3,5, 7, ... etc. are the primes). Show your work. Q4. Find the multiplicative inverse of 8 in GF(41) domain using Fermat's little theorem. Show your work. Q5. Using Euler's theorem, find the following exponential: 5400 mod 21. Show how you have employed Euler's theorem here. Bonus question [10 extra points]: Write a program (in any programming language) to implement Extended Euclidean algorithm with two input parameters a and b, and return the output as b'mod a. Run the program with a=33 and b=5 as input and print the results. Submit the source code and the output