Using JAVA:

(3) LeakyStack Stacks are often used to provide "undo" support in applications like a Web 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 eaking" the oldest element from the bottom of the stack to make room. Give an implementation of such a LeakyStack abstraction, using a circular array Input Format: Read input from a file "in3.txt". The first line contains T number of test cases. The first line of each test case is the capacity of the LeakyStack. Second line contains the consecutive operations in the browser Output Format: Write output in console. Print the content of the stack. Sample Input: 3 op_one op_two op_three op_four op_five Sample Output: op_five op four op_three