exercises for source code and help with exercisesplease visit java datastructures net reinforcement - suppose you label each node of binary tree with key equal to the preorder rank of under what circumstances is heapr- what is the output from the following sequence of priority queue adt methodsinsert( , )insert( , )insert( , )insert( , )removemin()insert( , )insert( , )removemin()removemin()insert( , )remove min()insert( , )removemin()removemin( - an airport is developing computer simulation of air-traffic control that handles events such as landings and takeoffs each event has time-stamp that denotes the time when the event occurs the simulation program needs to efficiently perform the following two fundamental operationsinsert an event with given time-stamp (that isadd future eventextract the event with smallest time-stamp (that isdetermine the next event to processwhich data structure should be used for the above operationswhyr- although it is correct to use "reversecomparator with the priority queue adt so that we retrieve and remove an entry with the maximum key each timeit is confusing to have an entry with maximum key returned by method named "removemin write short adapter class that can take any priority queue and an associated comparator and implement priority queue that concentrates on the element with maximum keyusing methods with names like removemax -