data structure python

(1) The stack content after the following series of stack operations: S.push (0);S.push(1);S.pop( );S.push(2);S.pop( );S.push(1); (2) After the operations of the question (1), the output of len(S) is: (3) The amortized complexity function of the stack pop() method is: (4) Assuming that the Stack is implemented using the list data type, the best fit method (function) to be used yielding the push() method is: (5) The value of the var2 variable after the execution is: 1246X=ArrayStack0str1="RoOF";foriinstr1:foriinstr1:var2="Hi"X.push(i)var2+=X.pop() Solve the questions (6,7,8) based on the following Python script: (6) The output of the print statement line 3 is: (7) The value of the sequence var2 [3:7] after execution the script is: (8) After execution the first 4 lines the value of len(var2) is: (9) The Queue content after the following series of queue operations: Q.enqueue(5); Q.enqueue(3); Q.dequeueO; Q.firstO; Q.enqueue(8); Q.dequeue O (10)After the operations of the question (Q9), the output of Q.dequeue 0 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