$2\mathrm{.}4\mathrm{.}1$ Suppose that the sequence PR I O$*$ R $**$ I $*$ T $*$ Y$***$QUE$***$ 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 letters returned by the remove the maximum operations.