Please write a testing class for the following program:

For the first part of the programming assignment, you will be implementing a Stack class. The Stack should not have any limit in capacity, so you should determine when it should resize to have more elements inside. The Stack should have the following fundamental functions: public class Stack > - boolean push( T value) - given a value as input, pushes it into the stack. The function returns true if it succeed in inserting, otherwise, false. - T pop () - tries to delete the element at the front of the stack. The function returns the value of the front element if it succeeds, otherwise, returns null. - T peek () - returns but not deletes the value of the front element in the stack if there is any; otherwise, it should return null