could youn please expalain step by step thnak ypu i will upvote

Suppose that the sequence N O R M * A * L * 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 final state of the queue (from front to back):

front to back