$8\mathrm{.}4$ In LC$3,$ write a function that implements another stack function, peek. Peek returns the value of the $$rst element on the stack without removing the element from the stack. Peek should also do under$$ow error checking. $($Why is over$$ow error checking unnecessary?$)$

Hints: A function is like a subroutine with a instruction RET. It will return to the caller program after the calling subroutine finished. This routine copies the value of the first element on stack into R$0.$ If underflow occurs, R$5$ is set to $1($failure$)$ else R$5$ remains $0($success$).$ Overflow error checking is not necessary because we are not adding The following operations are performed on a stack: PUSH A$,$ PUSH B$,$ POP, PUSH C$,$ PUSH D$,$ POP, PUSH E$,$ POP, POP, PUSH F

a$.$ What does the stack contain after the PUSH F$?$

b$.$ At which point does the stack contain the most elements? Without removing the elements left on the stack from the previous operations, we perform: PUSH G$,$ PUSH H$,$ PUSH I, PUSH J$,$ POP, PUSH K$,$ POP, POP, POP, PUSH L$,$ POP, POP, PUSH M

c$.$ What does the stack contain now?