Code to solve 3 java problems

In problems 1-3, you should not at any point call the stack's size() method or directly access its size. Problem 1: Create a class called StackSummary that implements this interface. It will have a private Stack for a field. Use generics so your stack can be of any type. Your class constructor should initialize its stack as a new empty stack. Comments in the interface instruct you on what the methods of your class should do. All fields for your class should be private and it should not have any methods other than the ones required to implement the interface. Note that the StackSummary pop and peek methods need not return anything. Problem 2: Write a public static method called randomize() that has no parameters and returns a StackSummary. Your code for this method should be, at least lightly, commented. You will likely want to use Java's Random class for this method. The method should do the following: Create a new StackSummary object with an Integer stack. Push an integer with values randomly from 1 to 1000, 1 to 100 times onto the stack. Pop randomly from 1 to 100 times. Peek randomly from 1 to 100 times. Returns the resulting StackSummary All of these push, pop, and peek operations should be done in a random order. That is, you do not do all the pushes before the pops and peeks, they will be interspersed, that is, you will have sequences like this: push(554) pop() peek() pop() push(25) push(997) Problem 3: Write a public static method size that takes a StackSummary object as a parameter and returns the size of its stack. As mentioned at the beginning, you should do this without ever directly accessing the size of the stack.