1:14 Done learn.ejust.org 1 JUSTLearn Given the doubly linked list in figure 3, what is the necessary code to insert a new node with info=2 before the first node with info=4? Suppose that we already...

Extracted text: 1:14 Done learn.ejust.org 1 JUSTLearn Given the doubly linked list in figure 3, what is the necessary code to insert a new node with info=2 before the first node with info=4? Suppose that we already created and instantiated the new node, and the pointer newNode points to it Figure 3: Doubly linked list first 12 last count 4 a. first->back=newNode; newNode->next=first: first=newNode: Ob. first-newNode: first->nextenewNode: newNode->back first Oc first=newNode: first->back=newNode; newNode->next=first O d. first->next=newNode; newNode-back=first firstenewNode: Clear my choice Consider the following empty circular Queue with count = 0. What is the contents of this queue after doing Ps More