Creating a stack with support for the minimum element

It is necessary to build a stack data structure that provides three basic operations: adding a new element (push), removing the top element (pop), and instant access to the smallest value currently in the stack.