What is the number of cycles required to execute $100$ instructions between a non$-$pipelined processor and a

pipelined processor?

If registers $A,B,$ and $C$ contain the values $12,65,$ and $87$ respectively, and they are pushed to the stack in the

orderA, then $B,$ then $C,$ what values do $A,B,$ and $C$ have if they then are pulled from the stack in the order C$,$

then $A,$ then $B?$

Convert the following assembly language to machine code.

LOADA ${1000}_{16}$

LOADB ${1001}_{16}$

CMPAB

JGT AGREATER

EXCAB

AGREATER: STORA ${1002}_{16}$