Write a class StackReverse that supports the following operations, with running time O(1) for each operation.

public class StackReverse {

public StackReverse() - a constructor, creates an empty stack public

void push(T item) - adds an element to the stack public

T pop() - removes an element from the stack public

void reverse() - reverses the order of the elements. That is, the element that was the last in the stack becomes the first, and vice versa

public int size() - returns the number of elements in the stack

public boolean isEmpty() - checks if the stack is empty } The running time of each operation must be O(1).