Please Briefly explain the answers.

Q3: Here is an implementation of add function in the doubly linked list. Complete the code by filling in the last line (??? Part) with your code and briefly explain your answer. // insert new node before v void DLinkedList::add (DNode* v, const Elem& e) { DNode* u = new DNode; // create a new node for e u->elm = e; // u coppies element of e u->next = 1; // link u in between v u -> prev = V-> prev; ??? // replace ??? with your code } // ... Q4: What is the content of the list after the following lines of code executes on an empty circularly linked list object called C? For full credits, show step by step result from each line of codes. C.add(10); C.add(20); C.advance(); C.add(30); C.advance(); C.add(40); C.advance(); C.remove()