Try this exercise. Is this statement true or false?

For the push operation of a stack implemented with a linked list, new nodes are inserted at the end. Thus, in a pop operation, nodes must be removed from the beginning.