Two Comp 162 instructors ask you to write a sequence of Pep/9 instructions that inputs M and leaves 35

times M in register A. You can assume that 35 times M does not overflow.

(a)

Professor X wants a solution that occupies the smallest possible number of bytes. What is your answer

and how many bytes does it occupy?

(b)

Professor Y wants a solutions that takes the fewest possible instruction executions when run. What is

your answer and how many instruction executions does it take?