Consider a hypothetical computer with an instruction set of only two n-bit instruc- tions.The first bit specifies the opcode, and the remaining bits specify one of the 2-1 n-bit words of main memory. The two instructions are as follows: 12.7 SUBS X Subtract the contents of location X from the accumulator, and store the result in location X and the accumulator. Place address X in the program counter JUMPX A word in main memory may contain either an instruction or a binary number in twos complement notation. Demonstrate that this instruction repertoire is reason- ably complete by specifying how the following operations can be programmed: a. Data transfer: Location X to accumulator, accumulator to location X b. Addition: Add contents of location X to accumulator c. Conditional branch. d. Logical OR. e. LO Operations