Repeat the previous problem using a singly linked list for storage, and a maximum capacity specified as a parameter to the constructor.

Previous problem

The introduction of Section 6.1 notes that stacks are often used to provide “undo” support in applications like aWeb browser or text editor. While support for undo can be implemented with an unbounded stack, many applications provide only limited support for such an undo history, with a fixed-capacity stack. When push is invoked with the stack at full capacity, rather than throwing an exception, a more typical semantic is to accept the pushed element at the top while “leaking” the oldest element from the bottom of the stack to make room. Give an implementation of such a LeakyStack abstraction, using a circular array.