What is the structure of the Doubly Linked List in below given syntax ?Optionsclass Node {public:  int data;  Node* next;};class Node {public:  int data;  Node* next;  Node* front;};struct link {  int info;  struct link* next;};struct Node {  int data;   struct Node* next;  struct Node* prev;};

What is a Doubly Linked List in data structures?a)A list of elements with two types of data.b)A list with elements arranged in ascending order.c)A list where each node points to both the previous and next nodes.d)A list where each node points to the next node only.

Question 2Which structure definition represents a singly linked list structure?1 pointstruct node { struct node next; uint32_t data;};union node { uint32_t data1; uint32_t data2;};struct node { uint32_t data; struct node * next; };struct * node { Struct node data; Struct node * ptr;};struct node { struct node * prev; struct node * next; uint32_t data;};

class Node {int data;Node* prev;Node* next;}; What does the above code represent :A. Represent node/element in a doubly linked listB. Represent node/element in circular doubly linked listGroup of answer choicesA and Bonly ANoneOnly B PreviousNext

What is a doubly linked list?A linked list with nodes that have pointers to the next node only.A linked list with nodes that have pointers to both the previous and next nodes.A linked list with nodes that have pointers to the previous node only.A linked list with no pointers to other nodes.

How is the last node identified in a doubly linked list?It points to `None`.It has a special flag.It has a reference to the first node.It has a pointer to the previous node.