2. Create a multiplication table in GF(22). This will be like the one we created in GF(23), only much simpler. The basic steps are: a. Convert the four 2-bit binary numbers (00,01, 10, and 11) to polynomials. b. Create a multiplication table by multiplying these polynomials. c. If a product has more than 2 bits (that is, there is an x2 in the product), reduce it using the mod of the prime polynomial x2 + x + 1. 2. Create a multiplication table in GF(22). This will be like the one we created in GF(23), only much simpler. The basic steps are: a. Convert the four 2-bit binary numbers (00,01, 10, and 11) to polynomials. b. Create a multiplication table by multiplying these polynomials. c. If a product has more than 2 bits (that is, there is an x2 in the product), reduce it using the mod of the prime polynomial x2 + x + 1