Can you help me with this JAVA question?

Question 8 (1 point) Which of the following is false? O A stack implemented with a linked list only needs a reference to one end of the list. of where things are enqueued and dequeued O A queue implemented with a linked list will have a front reference that is used for the dequeue operation. O A stack implemented with an array will have one array index used when pushing or popping. Save Question 9 (1 point) What is the main idea behind a priority queue? All tems are treated with the same importance, so items are processed in arrival order. Some items to be added to the queue are more important than others, so there is a way that the higher priority items are towards the front of the queue and the lower priority items are towards the back of the queue. OThe last item added to a priority queue is the most important, so that is the item which is processed first. A priority queue does not support the notion that some things are more important that others. Save