Consider the following scenarios: a

Subject:Computer SciencePrice:3.86 Bought11

Share With

Consider the following scenarios:

a. A priority queue is implemented using an array-based heap tree

b. A priority queue is implemented using a linked list.

c. A priority queue is implemented using a linked implementation of heap tree.

Is the priority queue created in the above scenarios dynamic/static and linear/non-linear? Justify your answer in each case.Required to answer. Multi Line Text.