Which implementation technique is commonly used for Priority Queues?a)Stacksb)Linked Listsc)Heapsd)Arrays

The implementation technique that is commonly used for Priority Queues is c) Heaps.

Here's why:

Priority Queues are a type of abstract data type that generalizes a queue. Each element in the priority queue has a priority associated with it. The priority of the elements in a priority queue determines the deletion order.

A heap is a complete binary tree that maintains the heap property. The heap property means that the key of each node is always greater than or equal to (in a max heap) or less than or equal to (in a min heap) the keys of its children. This makes heaps the ideal data structure for implementing priority queues as they can efficiently support the primary operations of a priority queue, which are insert, maximum/minimum and extract maximum/minimum.

While it's possible to implement a priority queue with stacks, linked lists, or arrays, these data structures do not perform these operations as efficiently as a heap. For example, finding the maximum/minimum element in an array or linked list takes linear time, while it takes constant time in a heap. Similarly, inserting an element or deleting the maximum/minimum element takes logarithmic time in a heap, while it can take linear time in an array or linked list.