Use Euclid’s algorithm to find integers x, y and d for which3936x + 1293y = d is the smallest possible positive integer. Usingyour answers to this as your starting point, do the followingtasks.
(a)Find an integer s that has the property that s ? d mod 3936and s ? 0 mod 1293.
(b) Find an integer S that has the property that S ? 573 mod3936 and S ? 0 mod 1293.
(c) Find an integer T that has the property that T ? 126 mod1293 and T ? 573 mod 3936.
(d) Is T the only number satisfying those two congruences; ifnot, which other numbers?
