(4) Draw the sequence of heaps produced when the operations

P R I O * R * * I * T * Y * * * Q U E * * * U * E

(where a letter means insert and an asterisk means remove the maximum) is applied to an initially empty max-oriented heap.