Consider an instruction for a hypothetical machine which supports all types of
addressing modes, as shown below, with a blank space which might be filled to complete
ADD − #2019
Assuming the machine always seeks for the smallest possible instruction,
which of the following statements about the instruction above is true in order to make it complete:
(A) A register-name must be placed to complete the instruction
(B) The instruction is complete and adds zero to 2019 and store it in accumulator.
(C) The instruction is complete and conforms zero address mode and the value 2019
is added to the value at top of the stack and the result is pushed onto the stack.
(D) The instruction is complete and conforms one address mode and the value 2019
is added to the value inside accumulator and the result is stored back in accumulator.