public class StackArray implements StackInterface $\{$

private int capacity;

private int top;

private T$[]$ stackArray;

public StackArray$($int capacity$)\{$

this.capacity $=$ capacity;

this.top $=-1$;

this.stackArray $=($T$[])$ new Object$[$capacity$]$;

$\}$

public void push$($T item$)\{$

if $($isFull$())\{$

throw new RuntimeException$("$Stack is full"$)$;

$\}$

stackArray$[++$top$]=$ item;

$\}$

public T pop$()\{$

if $($isEmpty$())\{$

System.out.println$("$unable to pop, stack is empty"$)$;

return null;

$\}$

T itemOnTop $=$ stackArray$[$top$]$;

stackArray$[$top$]=$ null;

top$--$;

return itemOnTop;

$\}$

public T peek$()\{$

if $($isEmpty$())\{$

System.out.println$("$unable to peek, stack is empty"$)$;

return null;

$\}$

return stackArray$[$top$]$;

$\}$

public boolean isEmpty$()\{$

return top $==-1$;

$\}$

public int size$()\{$

return top $+1$;

$\}$

public boolean contains$($T item$)\{$

for $($int i $=0$; i $<=$ top; i$++)\{$

if $($stackArray$[$i$].$equals$($item$))\{$

return true;

$\}$

$\}$

return false;

$\}$

public void print$()\{$

if $($isEmpty$())\{$

System.out.println$("$Stack is empty"$)$;

$\}$ else $\{$

System.out.print$("$Stack: $")$;

for $($int i $=$ top; i $>=0$; i$--)\{$

System.out.print$($stackArray$[$i$]+"")$;

$\}$

System.out.println$()$;

$\}$

$\}$

public int capacity$()\{$

return capacity;

$\}$

public boolean isFull$()\{$

return top $==$ capacity $-1$;

$\}$

$\}$