Please explain.

left (b) (4-marks] Now suppose we implement the deque as a doubly-linked list with no dummy nodes. right "D7.09.0 .8 .19 16 prev next Add two lines to complete the following code to reverse the contents of the deque. right left prev next You may use the function swap which only swaps two Node pointers (which are passed by reference). struct Node { string data; Node *prev, *next; }; void DLL::reverse() { Node *p=left; while( p != NULL ) { swap(p->next,p->prev); p=p->prev; swap(left,right)