show your work

Problem 5: (c) Use the minimum of powers of prime factors method to determine the GCD of: 22, 3), 55 and 29, 3), 52 (d) Use the maximum of powers of prime factors method to determine the LCM of: 22, 3), 55 and 29, 39, 52 Problem 6: Use the Extended Euclidean algorithm (write down all lines of steps) to find the GCD of the two integers n=8359 and m-9373 and integers s and t in the formula: GCD(m, n) - sm + tn