Write a push method for a stack implemented with an array. You may assume that the stack is referenced by an array named stack, and that there is an integer variable named count that keeps track of the number of elements in the stack. You may not assume that you have access to an expandCapacity method, nor should your code throw an exception if the stack is full. Your method should include code to expand the capacity of the array if it is full.

What will be an ideal response?

```
public void push(T element) {
if(count == stack.length) {
T[] newStack = new T[stack.length*2];
for(int i = 0; i < stack.length; i++)
newStack[i] = stack[i];
stack = newStack;
}
stack[count++] = element;
}
```