// Java Programming.

// 19 & 20

// Need to implement genericCode.

19. Expand the implementation of the class Stack presented in Figure 3.13 to include methods to: reinitialize the stack to empty, test for an empty stack (underflow condition), test for a full stack (overflow condition), and to perform a Peek operation. Include a progressively devel oped driver program to demonstrate the functionality of each new method. 20. Expand the implementation of the class Stack presented in Figure 3.13 so that it expands every time a Push operation is performed that would cause an overflow. Initially, it should accommodate a maximum of three nodes. Include a progressively developed driver progranm to demonstrate the functionality of each new class. 3.4 Generic Implementation of the Classic Stack, a Methodized Approach ublic class Genericstack 1. p 2. private TIl data; private int top; 4. private int size; 5. pblic Genericstacko { top= -1; data (T) new object( 1001; te 100 new 0) 10. public Genericstack(int n) 11. top1 sizen; data (TI1) new Object[n]; 12. 13. 15 GenericNode node(GenericNode) newNode; public boolean push (T newNode 16. if(top size 1) return false; overflow error 18 19. 20. top top 1; 21 22. 23. 24. 25. public T pop() 26. int topLocation; 27. 28. 29. 30. 31 32. 33. 34. 35. public void showAll (O 36. { for(int i = top; >= 0; i-) 37 else data[top] = (T) node . deepCopy(); return true; I push operation successful if(top-. 1) return null; underflow error else f topLocation top; top = top - 1; return datal topLocation]; System.out.printin (datali].tostringO) 38. // end of ShowAll method 39. / end of class GenericStack Figure 3.31 Generic Version of the Class stack Presented in Figure 3.13