Answer with all B$2,$ B$3$ values as well. The Advanced Encryption Standard $($AES$)$ uses substitutions created as inverses mod the irreducible polynomial m$($x$)=$ x$8+$x$4+$x$3+$x$+1.$ What is the substitution $($inverse$)$ of $11110000$ in this GF$(28).$ Use at least $8$ bits for each of the following responses A$2=$ A$3=$ B$2=$ B$3=$ Q$=$ B$2=$ B$3=$ Q$=$ B$2=$ B$3=$ Q$=$ B$2=$ B$3=$ The inverse is: