Answer:
1.
Additional information:
GF(2) - Galois field of two elements - is used in many areas including with Checksums and Ciphers. The multiplication function involves multiplying the binary values and ignoring the remainder. They are easy to implement and fast in their operation, especially in crypto and checksum functions. It basically involves some bit shifts and an EX-OR function, which makes it fast in computing the multiplication. For example 111 x 101 gives: 111 x101 ------ 111 000 111 ----- 11011 =====
Ans: