Q10. (7 pts) Solve either (a) or (b). (a) Find ged(4321, 765) using Euclid's algorithm. Show your calculations. Give necessary explanations. EUCLID (a,b) 1. A: a:B: 6 2. if B-o return A-ged(a,b) 3. R-A mod B 4. A: -B 5. BR 6. goto 2 (b) Find ged[a(x),b(x)] for a(x)=x? + x + x + x +x+1 and b(x)=x+x+x+1. Check correctness of your result by division of the polynomials with the god found. EUCLID[a(x),b(x)] 1. A(x):=a(x): B(x):=b(x) 2. if B(x)=0 return A(x)-ged[a(x),b(x)] 3. R(x):=A(x) mod B(x) 4. A(x):B(x) 5. B(x):-R(x) 6. goto 2