Treat the registers $R1,$dots,$R7,$ the program counter $PC,$ and the condition$-$codes $N,Z,P$ as variables which each hold a $16-$

bit number.

Treat M$[$a$]$ as the memory array of $16-$bit integers with the index a in the range: x$0000,...,$ xfFFF$.$

Assume that $PC$ contains the address of the current instruction and that $N=,Z=,P=1.$

If offset $6=10011,$ enter below the bit pattern that SEXT $($offset$6)$ equals

Extra spaces among the bits will not invalidate an answer.

After each of the following instructions enter the Java$($or Python$)-$like assignment statement $($but with no semi$-$colon$)$ which

performs what that specific instruction does in terms of the bits in the instruction itself $($with the NZP codes given above$)$ and

only using the names given above. If an instruction does nothing, write

Specify all offests with hexadecimal values; do not insert unneeded zeroes: for example, use $x1$ not $x*\frac{O}{01}$

The instruction: e$001010110090111$

Extra spaces or no spaces between arithmetic operators will not invalidate an answer.

The instruction:

Extra spaces or no spaces between arithmetic operators will not invalidate an answer.

The instruction: $1110110000110101$

Extra spaces or no spaces between arithmetic operators will not invalidate an answer.

The instruction: $0010110000110101$

Extra spaces or no spaces between arithmetic operators will not invalidate an answer.

The instruction: $1010110000110101$

Extra spaces or no spaces between arithmetic operators will not invalidate an answer.