Answer all questions please Question $q,(8$ points$)$

Sample Final Exam $($S$24)$

$(3$ pts$)$ What is a deque? Is it a LIFO or FIFO data structure?

$(5$ pts$)$ Is there an advantage of implementing a deque as a linked list instead of a Python list? Explain your answer using insertion as an example.

Question $(9$ points$)$

At a high level $($similar to the homework problem$),$ briefly describe how Quicksort sorts the list.

Given the following list, what will be the first pivot and the first two lists that will be worked on recursively? $9,22,11,32,3,5,8,1,2,27$

In $1-2$ sentences, explain the next step of the algorithm.