*Java* Expand the implementation of the class Stack presented in Fig 3.13 so that it expands every time a Push operation is performed that would cause an overflow. Initially, it should accommodate maximum of three nodes. Include a progressively developed driver program to demonstrate the functionality of each new class.

oublic class GenericStack { private T[ data; private int top; private int size: public GenericStack() { top = -1; size = 100; data = (TO) new Object1001 public GenericStack(int n) { top = -1; size = n; data = (Tl) new Objectin); public boolean push(T newNode) GenericNode node = (GenericNode) newNode: if(top== size - 1) return false; /** overflow error ** else { top = top + 1; data[top] = (T) node.deepCopy(); return true; // push operation successful public T pop() { int topLocation; if(top == -1) return null; // ** underflow error ** else { topLocation = top; top = top - 1; return data[topLocation); public void showAll() 36. { for(int i = top; i >= 0; i--) System.out.println(data[i].toString(); 38. } // end of showAll method 39. } // end of class Generic Stack 37. Figure 3.31 Generic Version of the Class Stack Presented in Figure 3.13 oublic class GenericStack { private T[ data; private int top; private int size: public GenericStack() { top = -1; size = 100; data = (TO) new Object1001 public GenericStack(int n) { top = -1; size = n; data = (Tl) new Objectin); public boolean push(T newNode) GenericNode node = (GenericNode) newNode: if(top== size - 1) return false; /** overflow error ** else { top = top + 1; data[top] = (T) node.deepCopy(); return true; // push operation successful public T pop() { int topLocation; if(top == -1) return null; // ** underflow error ** else { topLocation = top; top = top - 1; return data[topLocation); public void showAll() 36. { for(int i = top; i >= 0; i--) System.out.println(data[i].toString(); 38. } // end of showAll method 39. } // end of class Generic Stack 37. Figure 3.31 Generic Version of the Class Stack Presented in Figure 3.13