associated with this passenger operation removemin is not suitable for this purpose since the passenger leaving is unlikely to have first priority insteadwe would like to have new operation remove (ethat removes an arbitrary entry another standby passenger finds her gold frequent-flyer card and shows it to the agent thusher priority has to be modified accordingly to achieve this change of prioritywe would like to have new operation replacekey( ,kthat replaces with the key of entry in the priority queue finallya third standby passenger notices her name is misspelled on the ticket and asks it to be corrected to perform the changewe need to up date the passenger' record hencewe would like to have new operation replacevalue( ,xthat replaces with the value of entry in the priority queue methods of the adaptable priority queue adt the above scenarios motivate the definition of new adt that extends the prior ity queue adt with methods removereplacekeyand replacevalue namelyan adaptable priority queue supports the following methods in addition to those of the priority queue adtremove( )remove from and return entry replacekey( , )replace with and return the key of entry of pan error condition occurs if is invalid (that isk cannot be compared with other keysreplacevalue( , )replace with and return the value of entry of example the following table shows series of operations and their effects on an initially empty adaptable priority queue operation output insert( ,ae {( , )