Implement the ADT priority queue by using an array, as pictured in Figure 1a.
FIGURE 1 Two possible implementations of a priority queue using (a) an array;

We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.