(b) (6 marks) Given below are the (incomplete) steps to find god(132, 558) using Euclid's algorithm: (Here x means multiplication.) A =4x B+C B = 4XC+D C =2XD+E D = 2x E+0 i. What is E? Fill in the value of E only, e.g., 1. ii. Using the Extended Euclidean Algorithm, what are the integers s and t so that god (132, 558) = $x 132 |t x558? iii. Are s and t above unique, meaning, are they the only integers that satisfy god (132, 558) = s x 132 + t x 558? Answer Y or N only with no empty space before or after