show work neatly

2. (24 points) Consider the six operations in the table below. Operands are signed 4-bit numbers. Complete the table by showing the effect of the operation on each of the 4 status bits NZVC. (Assume a Pep-9 implementation of shift operations.) Each table entry should be one of the following: Y if the operation sets the bit to 1 N if the operation sets the bit to 0 N/A if the operation has no effect on this bit. Operation 0101 +1011 1110 AND 1001 Arithmetic left shift (1000) 1001 EXOR 0110 Arithmetic right shift 1) 001 OR 0011