Redesign the ArrayStack implementation on page $230$ of the recommended textbook $($Data Structures and Algorithms, Six edition$)$

to double the array size when it reaches maximum capacity for push operation.

public class ArrayStack implements Stack

public static final int CAPACITY $=1000\frac{\text{;}}{\frac{?}{?}}$ default array capacity

private E$[]$ data; $\frac{,}{\frac{?}{?}}$ generic array used for storage

private int $t=-1$;$\frac{,}{\frac{?}{?}}$ index of the top element in stack

public ArrayStack$()\{$ this$($CAPACITY$)$; $\}///$ constructs stack with default capacity

public ArrayStack$($int capacity$)\{//$ constructs stack with given capacity

data $=(E[])$ new Object$[$capacity$]$; $\frac{,}{\frac{?}{?}}$ safe cast; compiler may give warning

$\}$

public int size$()\{$ return $(t+1)$;

public boolean isEmpty$()\{$ return $(t==-1$

public void push$(E$ e$)$ throws IllegalStateException $\{$

if $($ size$()==$ data. length$)$ throw new IllegalStateException$("$Stack is full"$)$;

data$[++t]=e$;$\frac{,}{\frac{?}{?}}$ increment $t$ before storing new item

$\}$

public $E$ top$()\{$

if $($isEmpty$())$ return null;

return data$[$t$]$;

$\}$

public $E$ pop$()\{$

if $($isEmpty$())$ return null;

$E$ answer $=$data$[t]$;

data $[t]=$ null; $\frac{,}{\frac{?}{?}}$ dereference to help garbage collection

$t--$;

return answer;

$\}$

$\}$