DLLNode p= head; if ( p== nullptr) return; while ( p>val!=v) p=p> next; if ( p != nullptr &&p!= tail) \{ tail next =p; p prev next =p> next; p next prev =p prev; p prev = tail; p next = nullptr; tail = tail next \} a. Assuming v=6, redraw the following list after executing the above code. b. Explain what the code is intended to do. Provide a brief description of the purpose of the code, not a line-by-line explanation. c. Give an example of a linked list on which this code wouldn't work correctly, and explain what the error is. d. Assuming the list is of size n, what is the worst case running time of this code