Consider a priority queue has been implemented as a binary max heap and is stored as an array.

80 18 40 13 25

array representation of the heap:

index 0 1 2 3 4 5 6 7 8 9
value 80 18 40 13 5 25 1 2 9
note that -

0th position is left empty

left child of a[ i ] can be found at a[ 2 * i ].

right child of a[ i ] can be found at a[ 2 * i + 1 ].

the parent of a[ i ] is at a[ i / 2 ].

now a pop-heap operation is called on this data structure. what will be the array after this pop?