5. Let us consider LSB-first bit-level multiplication in GF. Assuming A and B as the operands, we use the following architecture to find the result C in GF(244) with the irreducible polynomial P(x) = x^4 +x+1. Note that m=4 in the figure. Xc 6--6-2 16 - Find the number of ANDs and XORs you need to implement this example (m=4). Of course, you need to have m=4 ANDs and XORs for everything outside the x-module. Your job is to simplify the x-module to see how many more gates you need (O XOR a= a). 5. Let us consider LSB-first bit-level multiplication in GF. Assuming A and B as the operands, we use the following architecture to find the result C in GF(244) with the irreducible polynomial P(x) = x^4 +x+1. Note that m=4 in the figure. Xc 6--6-2 16 - Find the number of ANDs and XORs you need to implement this example (m=4). Of course, you need to have m=4 ANDs and XORs for everything outside the x-module. Your job is to simplify the x-module to see how many more gates you need (O XOR a= a)