Problem
1. Describe efficient algorithms for performing operations remove(e) and replaceKey(e,k) on an adaptable priority queue realized by means of an unsorted list with location-aware entries.
2. Describe efficient algorithms for performing operations remove(e) and replaceKey(e,k) on an adaptable priority queue realized by means of a heap with location-aware entries.