Write a Java class named GenericStack that implements a gene…
Write a Java class named GenericStack that implements a generic stack. The stack should use an array internally to store its elements. Assume the stack has a fixed capacity limit, which will not be exceeded during operations. Your implementation should include the following methods: A constructor to initialize the stack. push(): Adds an item to the top of the stack. pop(): Removes and returns the item from the top of the stack. Throw an Exception if the stack is empty. peek(): Returns the item on the top of the stack without removing it. Throw an Exception if the stack is empty. isEmpty(): Returns true if the stack is empty, otherwise false. isFull(): Returns true if the stack is full, otherwise false. getOperationsCount(): Returns the total number of operations (push(), pop(), or peek()) that have been performed on the stack. You may use the following line of code in your constructor to initialize the array: elements = (T[]) new Object[size]; Example Usage: GenericStack stack = new GenericStack(10);stack.push(10);stack.push(20);stack.peek();stack.pop(); System.out.println(stack.peek()); // Output: 10 System.out.println(stack.pop()); // Output: 10 System.out.println(stack.isEmpty()); // Output: trueSystem.out.println(“Operations performed: ” + stack.getOperationsCount()); // Output: Operations performed: 6 Notes: You do not need to implement dynamic resizing. Ensure your code is efficient and follows Java best practices.
Read Details