Question: 10
(Choose 1 answer)
What is the correct sequence of steps to add a new node to the end of a doubly linked list in Python?
A. Traverse the list to the end, update the last node's next pointer, and set the new node's previous pointer.
B. Create a new node, set its data and pointers, and update the head pointer.
C. Create a new node, set its data and pointers, and update the tail pointer.
D. Traverse the list to the end, update the last node's previous pointer, and set the new node's next pointer.
E. None of the others.
