Determine the multiplicative inverse ofx-S + x2 + I in GF(24), using the prime (irreducible) polynomial m(x) = x 4 + x + I as the modulo polynomial. (Hint: Adapt the Extended Euclid's GCD algorithm on pages 25 and 26 of the notes to polynomials.)