Find integers s and r so that 420s-15731=1, and use it to solve the congruence 420x 1 (mod 1573). b) Use Extended Euclidean Algorithm to find integers s and such that ged(34,126) = 34s + 126r, and use it to solve the congruence I 34x = 2 (mod 126). c) Find integers s' and t' such that ss' and t#t' where s and are the integers found in part b, and ged(34,126)=34s + 126r'. How many such integers s' and r' can be found?