Please show all of your work. Please DON'T just write the answer. I want to understand.

The following operations are performed on a stack:

PUSH A$,$ PUSH B$,$POP, PUSH C$,$PUSH D$,$ POP, PUSH E$.$

POP, POP, PUSH F

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

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

What does the stack contain now?