Consider a hypothetical computer with an instruction set of only two n-bit instructions. Thefirst bit specifies the opcode, and the remaining bits specify one of the 2n−1 n-bit words ofmain memory. The two instructions are as follows:1. SUBS X – Subtract the contents of location X from the accumulator, and store the resultin location X and the accumulator.2. JUMP X – Place address X in the program counter.A word in main memory may contain either an instruction or a binary number in twoscomplement notation. Demonstrate that this instruction repertoire is reasonably complete byspecifying 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. I/O Operations.

"Hey, Hi I need the solution for C,D &E,  for the above question, I found solution for A&B, THANK YOU"