the heapsort java program we can put these two tricks--applying trickledown(without using insert()and using the same array for the initial data and the heap--together in program that performs heapsort listing shows how this looks listing the heapsort java program /heapsort java /demonstrates heap sort /to run this programc>java heapsortapp import java io */for / import java lang integer/for parseint(///////////////////////////////////////////////////////////////class node public int idatapublic node(int keyidata key/end class node /data item (key/constructor ///////////////////////////////////////////////////////////////class heap private node[heaparrayprivate int maxsizeprivate int currentsize/size of array /number of items in array /public heap(int mx/constructor