In a PriorityQueue, how are elements ordered by default?*0 pointsIn insertion orderIn ascending order (natural order)In descending order (reverse natural order)In random orderWhich data structure in Java is best suited for random access and has constant-time complexity for accessing elements by index?*0 pointsArrayListLinkedListPriorityQueueIn Java, which data structure is implemented as a dynamic array and is not suitable for frequent insertions and deletions at the beginning or middle of the collection?*0 pointsArrayListLinkedListPriorityQueue

Which data structure in Java is an ordered collection that allows for efficient retrieval of the highest-priority element?*0 pointsArrayListLinkedListPriorityQueueWhich data structure in Java is implemented as a doubly-linked list and is suitable for frequent insertions and deletions at the beginning or middle of the collection?*0 pointsArrayListLinkedListPriorityQueue

In a linked list implementation of a priority queue, how is the order of elements determined?*1 pointElements are randomly orderedElements are sorted by their valuesElements are sorted by their insertion orderElements are sorted by their priorities

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.ArrayLinkedListHeap Data Structures like Binary Heap, Fibonacci HeapAll of the above

Which Java Collection class allows generic elements to be stored in a sorted order?Question 3Answera.ArrayListb.PriorityQueuec.TreeMapd.HashSet

Which of the following data structures uses a Last In First Out (LIFO) ordering principle?QueueStackLinked listBinary search tree