CAUsers micha OneDrive Documentsi vinter 201 8comp 367 Mast332-Winter2018-Assignment5.m *- Server 1 1 -Maple 2017 File Edit View Insert Format Table Drawing Plot Tools Window Help Alt+S Mast332-Winter 2018-Assignment5.mw Math Drawing Plot Animation Hide P Heading 1 Seri Question 4 (A) Apply the Euclid's algorithm to find the greatest common divisor (in the form of monic polynomial) in F^[r] of | A2 _ x + 4 and g=x3 + 2x2 + 3x+2 (B) Apply the Extended Euclid's algorithm to solve the Bezout's Identity f:X + g-Y = gcd(f, g) for the polynomials f and g above Solution: Ready Maple Default Profile C:wsersymicheOneDrivepocumentshnter 2018'comp 367 Memory: 4.18M Time: 0.15s Zoom: 125% Text Mo ENG 617 PM O Type here to search ^q)) US 2018-03-21