Given a head node of doubly linked list, write a function to delete every other node in the list starting at the second node. The function should return the head node after deleting the necessary nodes.

struct Node{

int value;

Node *next;

Node *previous;

}

Node *DeleteAlternateNode(Node *head)

Examples:

Given linked list : nullptr <- 1 <-> 2 <-> 3 <-> 4 <-> 5 -> nullptr

Output : nullptr <-1 <-> 3 <-> 5 -> nullptr