Consider the following code segment ,  The variable q is an object of type Queue, the variable s is an object of type Stack.   peek method looks at the first element in the queue without removing it. the remove method removes the first element from the queue. add method adds an element to the and of the queue or add an element to the top of the stack. pop method removes an element from the top of the stack What would be the content of the variable q (8 numbers) after we complete the second while loop in the code       for (int i = 30; i <= 40; i ++)       {          if(i % 3 == 0)             q.add(i);     }          while (!q.isEmpty()) {          s.add(q.peek());          s.add(q.peek());          q.remove();       }       while (!s.isEmpty()) {         q.add(s.pop());       }

A-1: Let l = [−1, −2, . . . , −10] be an existing list. Construct a new list from l by dividing each evennumber element in l by 2. Print the new list. Do not use NUMPY library.A-2: Create a new list containing the following elements using list comprehension:[1, −1, 2, −2, 3, −3, ..., 9, −9]A-3: Consider the following coded string. Create a list of all contiguous (connected without space) lettersin the order of their appearance."Vjg dguv rtqitcou ctg ytkvvgp uq vjcv eqorwvkpi ocejkpgu ecp rgthqto vjgoswkemn{0 Cnuq. vjg dguv rtqitcou ctg ytkvvgp uq vjcv jwocp dgkpiu ecp wpfgtuvcpfvjgo engctn{0 C iqqf guuc{kuv cpf c iqqf rtqitcoogt jcxg c nqv kp eqooqp0"A-4: In the list obtained after executing task(s) from Part(A-3), remove newline characters (if any).A-5: For the list obtained after executing task(s) from Part(A-4), for each word in the list do thefollowing:ˆ Breakdown the word into list of letters.ˆ Convert each of the above letters into integer, using ord() function.ˆ Update the…

The tail of a linked list is distinguished from other nodes because its next pointer is:A. void B. empty C. NULL D. None of the above.

Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1     You cannot remove an item from from existing list that is empty      Removing an item from an existing list decreases its length by one     Removing an item from an existing list increases the list size by one     None of these

Suppose that queue is an object of type queueType<int> of size 50, the index of the first element of queue is 7, and the index of the last element of queue is 25. Also suppose that num is a variable of type int. a. How many elements are in queue?b. Write the statement that assigns the first element of queue to num.c. Write the statement that removes the first element of queue.d. Write the statement that inserts 28 into queue.

Structure data : Stacks and queues [see the image]