A warehouse is controlled by an electronic lock having an n$-$digit combination. The electronic lock has ten buttons labeled $0$ to $9$ on its face. To open the lock, a user presses a sequence of n buttons. The corresponding ASCII characters get loaded into sequential locations of memory, starting at location x$3150.$ After n buttons have been pressed, the null character x$00$ is loaded into the next sequential memory location. The following program determines whether or not the lock should open, depending on whether the combination entered agrees with the combination stored in the n memory locations starting at x$3100.$ If the lock should open, the program stores a $1$ in location x$3050.$ If the lock should not open, the program stores a $0$ in location x$3050.$ Note that some of the instructions are missing. Complete the program by filling in the missing instructions. Please enter your instructions as unspaced, $16$ bit binary numbers.

HINT: It may be easier to solve this in a non$-$linear way. i$.$e$.$ determine the instruction in x$3008$ before x$3004,$ etc. Some missing instructions are easier to determine with the added context of other missing instructions being added

$\backslash$begin$\{$tabular$\}\{|$l$|$l$|$l$|\}\backslash$hline x$3000$ & $0101101101100000$ & ;R$5<$x$0000\backslash \backslash \backslash$hline x$3001$ & $0010000000001111$ & ;R$0<$M$[$x$3011]\backslash \backslash \backslash$hline x$3002$ & $0010001000001101$ & ;R$1<$M$[$x$3010]\backslash \backslash \backslash$hline x$3003$ & $0110010000000000$ & ;R$2<$M$[$R$0]\backslash \backslash \backslash$hline x$3004$ & & $\backslash \backslash \backslash$hline x$3005$ & $0110011001000000$ & ;R$3<$M$[$R$1]\backslash \backslash \backslash$hline x$3006$ & $100101101111111$ & ;NOTR$3\backslash \backslash \backslash$hline x$3007$ & $0001011011100001$ & ;R$3<$R$3+1\backslash \backslash \backslash$hline x$3008$ & & $\backslash \backslash \backslash$hline x$3009$ & $0000101000000100$ & ; Branch to x$300$E if N or P is set $\backslash \backslash \backslash$hline x$300$A & & $\backslash \backslash \backslash$hline x$300$B & & $\backslash \backslash \backslash$hline x$300$C & $000011111110110$ & ; Branch always to x$3003\backslash \backslash \backslash$hline x$300$D & & $\backslash \backslash \backslash$hline x$300$E & $0011101001000001$ & ; Store R$5$ in x$3050\backslash \backslash \backslash$hline x$300$F & $1111000000100101$ & ; HALT $\backslash \backslash \backslash$hline x$3010$ & $0011000100000000$ & ; x$3100\backslash \backslash \backslash$hline x$3011$ & $0011000101010000$ & ; x$3150\backslash \backslash \backslash$hline $\backslash$end$\{$tabular$\}$