$($ii$)$ Polynomial Modulus over GF with $m(x)$

Write a function to long divide two polynomials, i$.$e$.(A(x),m(x)).$ Use the binary shortcut to indicate the values of $A(x)=a_n^{**}{x}^n+a_{a-1}^{**}{x}^{n-1}+$dots

$a_5{x}^5+a_4{x}^4+a_3{x}^3+a_2{x}^2+a_4{x}^1+a_0{x}^0$ becomes the binary number $a_n{a}_{n-1}dots{a}_5{a}_4{a}_5{a}_2{a}_1{a}_0$ and perform the respective bitwise operations.

This makes $m(x)=0x11B$ in hexadecimal for example. The function use modulo $2$ math. A possible algorithm:

Unsigned int divide$\_$galois$(A(x),m(x))$

$\{$

result $=A(x)$;

while $($get$\_$degree$($result$)>=$ get$\_$degree $(m(x))\{$

$\}$

result $=$ result XOR $($ get$\_$degree result

$***$Please write this function in JAVA!!!$***$

$***$Also please give outputs for the galois fields prompts below using the calculator function created above$***$

get$\_$degree$(0$x$3$CF$0)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

get$\_$degree$(0$x$10000)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

get$\_$degree$(0$x$00)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

get$\_$degree$(0$x$01)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

divide$\_$galois$(0$x$1000,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

divide$\_$galois$(0$xE$1,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

divide$\_$galois$(0$x$32$CFE$1,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

divide$\_$galois$(0$xE$1,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

multiply$\_$galois$(0$xD$5,0$x$61,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

multiply$\_$galois$(0$x$1$E$3$C$,0$x$1$E$3$C$,0$x$11$B$)=\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$