(9) The Queue content after the following series of queue operations: Q.enqueue(5); Q.enqueue(3); Q.dequeue(); Q.first(); Q.enqueue(8); Q.dequeueO (10)After the operations of the question (Q9), the output of Q.dequeue) is: (11)Assume a Deque instance is not empty nor full. The following function can be used in a Deque class with the target and name of: (12) Related to the Singly Linked List, how to make the following script working correctly? 12345defaddfirst(Lst,element):newest=Node(element)Lst.head=newestnewest.next=Lst.headLst.size=Lst.size+1 (13) The number of the nodes in an empty doubly linked list is: (14) The number of the pointers for every node in a singly linked list is: (15) In the Circularly linked list, there is no head pointer. Why