How is the deletion of a node at the end of a Doubly Linked List different from a Singly Linked List?a)It does not require any pointer update.b)It requires traversing the entire list.c)It involves updating two pointers.d)It requires finding the middle of the list.

The deletion of a node at the end of a Doubly Linked List is different from a Singly Linked List in the way that it involves updating two pointers.

Here are the steps for deleting a node at the end of a Doubly Linked List:

1. Check if the head is null (i.e., the list is empty). If it is, there's nothing to delete, so return.
2. If the head is the only node in the list (i.e., head->next is null), delete the head and set it to null.
3. Otherwise, create a temporary node and set it to head.
4. Traverse the list by moving the temporary node to its next node repeatedly, until the next node is the last node.
5. Set the next node of the second last node to null.
6. Delete the last node.

In contrast, here are the steps for deleting a node at the end of a Singly Linked List:

1. Check if the head is null (i.e., the list is empty). If it is, there's nothing to delete, so return.
2. If the head is the only node in the list (i.e., head->next is null), delete the head and set it to null.
3. Otherwise, create two temporary nodes, secondLast and last, and set them to head.
4. Traverse the list by moving the last node to its next node repeatedly, until it is the last node. For each move, also move the secondLast node to its next node.
5. Set the next node of the secondLast node to null.
6. Delete the last node.

As you can see, the main difference is that in a Doubly Linked List, we can move backwards from the last node to the second last node by using the previous pointer, while in a Singly Linked List, we have to keep track of the second last node while traversing the list.