class representing points in the plane with integer coordinates the priority queue adt having described the composition and comparator patternslet us now define the priority queue adtto support the following method for priority queue psize()return the number of entries in isempty()test whether is empty min()return (but do not removean entry of with smallest keyan error condition occurs if is empty insert( , )insert into key with value and return the entry storing theman error condition occurs if is invalid (that isk cannot be compared with other keys removemin()remove from and return an entry with smallest keyan error condition occurs if is empty