Consider a special kind of stack that has a finite size but allows an unlimited number of push operations. If the stack is full when a push occurs, the stack makes room for the new entry by deleting...

Consider a special kind of stack that has a finite size but allows an unlimited number of push operations. If the stack is full when a push occurs, the stack makes room for the new entry by deleting the entry at its bottom. A browser that maintains a limited history could use this kind of stack. Implement this stack by using a deque.