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

Which data structure uses LIFO (Last In, First Out) method?QueueArrayStackLinked List

Which data structure follows the First-In-First-Out (FIFO) principle?a.Treeb.HashMapc.QueueQueues follow the FIFO principle, where the first element added is the first one to bed.Stacke.LinkedLis

Which of the following is true about Queue data structureAnswer choicesSelect only one optionREVISITFollows LIFO (Last In First Out) principleLinear treeFollows FIFO (First In First Out) principleOrdered array

In a linked list implementation of a priority queue, how is the order of elements determined?

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