Heaps Write a Java application that implements the following three methods for a heap.getGreaterEqualCnt – return a count of the number of values in the heap that are >= a given parameter valuetrimLessThan – remove any nodes from the heap that contain data values < a given parameter valuetrimHeap – called by “trimLessThan” to perform trim operationsStarter code for this assignment is available on the course Web site.After the trim operation is performed, every parent node data value
OR
OR