$($MIPS$-$ Branch and Jump$)$ Write the $32-$bit machine code as $8$ hexadecimal digits for the beq, bne, and j instructions in the following code sequence. Assume all instructions are$$ located in memory between addresses $0$x$00000000$ and $0$x $0$FFF FFFF$,$ and the addi instruction$($label TEST$)$ is located at $0$x$00$C$40$AB$0.$

loop:$$

add $s$2,$ $s$2,$ $s$3$

bne $s$1,$ $s$2,$ ELSE$$

# $7$ instructions here$$

j TEST$$

ELSE:$$

# $18$ instructions here$$

TEST:$$

addi $s$1,$ $s$1,1$

beq $s$1,$ $s$0,$ loop