Using the model CPU demonstrated in class, write code using the simple machine language of the Language Description Table to solve the following problem: $(17+9)*6.$ Store the result in memory location EE$.$ Your code must include a loop, meaning it needs to have a conditional and unconditional jump. Do not forget to convert the decimal values into hex when writing the code.Language Description Table

$($Brookshear$\text{'}$s Appendix C$)$

$16$ registers $[0..$F$]256$ memory cells $[00..$FF$](8$ bits each$)$

$16-$bit instructions $(4+12)$ R$,$ S$,$ T $=$ register numbers $x,Y=$ values or addresses

$\backslash$table$[[$Op$-$code,Operand,Description$],[1,$RXY$,\backslash$table$[[$LOAD the register R with the bit pattern found in the memory cell whose address is XY$.],[$Example: $14A3$ would cause the contents of the memory cell located at address A $3$ to be$],[$placed in register $4.]]],[2,$RXY$,\backslash$table$[[$LOAD the register $R$ with the bit pattern $xY.],[$Example: $20A3$ would cause the value $A3$ to be placed in register $0.]]],[3,$RXY$,\backslash$table$[[$STORE the bit pattern found in register $R$ in the memory cell whose address is XY$.],[$Example: $35B1$ would cause the contents of register $5$ to be placed in the memory cell$],[$whose address is B$1.]]],[4,$ORS,$\backslash$table$[[$MOVE the bit pattern found in register $R$ to register $S.],[$Example: $40A4$ would cause the contents of register $A$ to be copied into register $4.]]],[5,$RST$,\backslash$table$[[$ADD the bit pattems in registers $S$ and $T$ as though they were two's complement$],[$representations and leave the result in register $R.],[$Example: $5726$ would cause the binary values in registers $2$ and $6$ to be added and the sum$],[$placed in register $7.]]],[6,$RST$,\backslash$table$[[$ADD the bit pattems in registers $S$ and $T$ as though they represented values in floating$-$point$],[$notation and leave the floating$-$point result in register $R.],[$Example: $634E$ would cause the values in registers $4$ and $E$ to be added as floating$-$point$],[$values and the result to be placed in register $3.]]],[7,$RST$,\backslash$table$[[$OR the bit patterns in registers $S$ and $T$ and place the result in register $R.],[$Example: $7CB4$ would cause the result of OR$-$ing the contents of registers $B$ and $4$ to be$],[$placed in register $C.]]],[8,$RST$,\backslash$table$[[$AND the bit pattems in registers $S$ and $T$ and place the result in register $R.],[$Example: $8045$ would cause the result of AND$-$ing the contents of registers $4$ and $5$ to be$],[$placed in register $0.]]],[9,$RST$,\backslash$table$[[$XOR the bit patterns in registers $S$ and $T$ and place the result in register $R.],[$Example: $95F3$ would cause the result of XOR$-$ing the contents of registers $F$ and $3$ to be$],[$placed in register $5.]]],[$A$,$ROX,$\backslash$table$[[$ROTATE the bit pattern in register $R$ one bit to the right $x$ times. Each time place the bit that$],[$started at the low$-$order end at the high$-$order end.$],[$Example: $A403$ would cause the contents of register $4$ to be rotated $3$ bits to the right in a$],[$circular fashion.$]]],[$B$,$RXY$,\backslash$table$[[$JUMP to the instruction located in the memory cell at address XY if the bit pattem in register$],[R$ is equal to the bit pattern in register number $0.$ Otherwise, continue with the normal$],[$sequence of execution. $($The jump is implemented by copying $xY$ into the program counter$],[$during the execute phase.$)],[$Example: B$43$C would first compare the contents of register $4$ with the contents of register $0.],[$If the two were equal, the pattern $3$C would be placed in the program counter so that the next$],[$instruction executed would be the one located at that memory address. Otherwise, nothing$],[$would be done and program execution would continue in its normal sequence.$]]],[$C$,,\backslash$table$[[$HALT execution.$],[$Example: COO@ would cause program execution to stop.$]]]]$