Can someone expain this to me? please provide clear explanation and clear to read.

This question deals with the nite eld GF(24). GF(24) is obtained as 212M {mod 1:4 + 3:3 + 1). Note that in some parts, you may need to use long division of polynomials. And in the the last question, you will learn of the extended Euclidean algorithm for polynomials. A brief description of this algorithm is given below. Compute the following elements of ZQLTI (mod 2:4 I :33 I 1). (a) {r2 + new as) (b) [$3 + 2:2 +1)+(:c3 + 2:?) (c) (12+ 3 + 1) + (9:3+&: + 1). (d) (we ms + 1r]. For the last part, you need to compute inverses in GF(24). For instance, to compute {I3 I 1)_1, we proceed as in the case of integers. Step 1. First compute the gcd(:r3 + 1.34 + :33 + 1). Here use the Euclidean algorithm for polynomials. Each step in the Euclidean algorithm is a long division of polynomials with remainder. Just make sure that the remainder has degree less than that of the divisor at every step. Step 2. As in the case of integers, trace your steps back and nd polynomials 3(a) and at) such that {33 I 1)s{m) I (3:4 I 33 I 1)t(:r) gcd[m3+1,m4+:123I1). Part (aw) For each part? receives ' marks for a correct computation of the part. This requires the correct utilisation of the long division with remainder, when necessary. For different levels of correctness, the student receives between 2 and 0 marks. Part (e) recieve marks for correctly applying the Euclidean algorithm and extended Euclidean algorithm to the polynomials 11:3 I 1 and 2:4 +223 + 1. Two extra marks are giving for carrying out appropriate long divisions