IN JAVA PLEASE $!!$

Need help implementing

public add$($T newEntry$)$ and

public T removeMin$()$

import java.util.Arrays;

public class MinHeap$>\{$

private T$[]$ heap;

private int lastIndex;

private boolean integrityOK $=$ false;

private static final int DEFAULT$\_$CAPACITY $=5$;

private static final int MAX$\_$CAPACITY $=1000$;

public MinHeap$()\{$

this$($DEFAULT$\_$CAPACITY$)$;

$\}$

public MinHeap$($int initialCapacity$)\{$

if$($initialCapacity $<$ DEFAULT$\_$CAPACITY$)\{$

initialCapacity $=$ DEFAULT$\_$CAPACITY;

$\}$

else if$($initialCapacity $>$ MAX$\_$CAPACITY$)\{$

throw new IllegalStateException$("$array too large"$)$;

$\}$

T$[]$ tempHeap $=($T$[])$ new Comparable$[$initialCapacity$+1]$;

heap $=$ tempHeap;

lastIndex $=0$;

integrityOK $=$ true;

$\}$

private void checkIntegrity$()\{$

if$($integrityOK$==$false$)\{$

throw new SecurityException$("$array was not made right!"$)$;

$\}$

$\}$

public void add$($T newEntry$)\{$

$//$TODO

$\}$

public T removeMin$()\{$

checkIntegrity$()$;

$//$TODO

return null; $//$ Return the maximum value

$\}$

public boolean isEmpty$()\{$

return lastIndex$<1$;

$\}$

public int getSize$()\{$

return lastIndex;

$\}$

public void clear$()\{$

checkIntegrity$()$;

while$($lastIndex $>-1)\{$

heap$[$lastIndex$]=$ null;

lastIndex$--$;

$\}$

lastIndex $=0$;

$\}$

public void print$\_$array$()\{$

System.out.println$($Arrays$.$toString$($heap$))$;

$\}$

$\}$