Suppose that the sequence PRIO * R * M * 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 priority queue. Give the sequence of heaps and the sequence letters returned by the remove the maximum operations