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.

9.3. Heaps 371 (4,C) (5,A) (6,7) (15,K) (9,F) (7,0) (20,B) (16,X) (25,J) (14,E) (12,H) (11,S) (13,W) Figure 9.1: Example of a heap storing 13 entries with integer keys. The last position is the one storing entry (13,W)