Consider implementing a priority queue with an unsorted linked list i.e., the linked list is maintained so that next element to be inserted goes at the head of linked list.Compared to heaps, is this an efficient implementation of priority queue? First give YES or NO, And briefly explain your answer.