Head Next Next NULL Prev A Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list. Now. You have a list and a node like the ones depicted below. head is pointing the node containing 1 and tail is pointing the node containing left after the following code runs: n->next left->next; left->next->previous Left->next =n; n->previous =left; n; what is the order of traversing the list from tail to head? Write each number separated by a single space 0 Select one: a. 54 21 b. 54321 C. seg fault d. 5321