Try this exercise. Fill in the missing part by typing it in.

To perform the push operation in a stack, we need to check if the stack is ____. If the stack is full, it is considered a stack ____. If the stack is not full, we add the element to the top of the stack and ____ the top pointer.

To perform the pop operation in a stack, we need to check if the stack is ____. If the stack is empty, it is considered a stack ____. If the stack is not empty, we remove the element from the top of the stack and ____ the top pointer.

The peek operation allows us to ____ the element at the top of the stack without removing it. This operation is useful when we want to check the ____ value in the stack without modifying the stack itself.