i always thumbs up correct answers :) thank you in advance

Describe all the steps of the adaptable priority queue call "remove (e)" for entry "e" storing (16, X) in the heap of figure 9.1 on pg 371. (4.c) (5.A) (6,2) (15,K) (9,F) (7,0) (20,B) (16,X) (25.J) (14,E) (12.1) ((11,5) (13.6) Figure 9.1. Example of a heap storing 13 entries with integer keys. The last position is the one storing entry (13,W)