5221 , , , , null] Additional instructions: 0 The insert operation should still take only O(log N) time (N is the size of the heap). This means that you cannot search the heap to check if an item is already present. 0 Use a Hash Map (java.util.HashMap), to record the current heap array position for each item in the heap. If an item is already present, insert the new object in place of the old one and then adjust the position for that item. Make sure to keep the Hash Map up-to-date on each heap operation. 0 Do not change the signature of the BinaryHeap class or any of its methods. You can, of course, add methods and instance variables. 0 You should be able to adjust the priority of an item in either direction (making the priority value smaller or larger). Submit Assignment to 1 8 Dashboard Calendar To Do Notifications Inbox