Assuming the priority queue is implemented as a heap, the first step is to insert the new element in the first available position in the list.
What is Priority Queues about?
Priority Queue is known to be one that is like a queue that is where one can insert an element mainly or ranging from the back and delete an element using the front.
Note that a new element one has to put the new element into the heap when there is a first available location and as such, assuming the priority queue is implemented as a heap, the first step is to insert the new element in the first available position in the list.
Learn more about priority queue from
https://brainly.com/question/15878153
#SPJ1
