Hello can i get help on these questions please.

(1) Consider the pairs (56343, 2072) and (31363, 3761). (a) Compute the greatest common divisor (ged) of each pair using the Euclidean algorithm (5+5 marks). (b) For each pair (a, b) in the question, use the extended Euclidean algorithm to find integers x and y such that ax + by = god(a, b) (5+5 marks). (c) For each pair (a, b) in the question, find the modular inverse of a mod b and b mod a if it exists; if it doesn't exist, give a reason (2+2 marks)