A doubly linked list node is declared as struct Node { int Value; Node *Fwd: Node *Bwd; ); Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node after the one pointed to by X from the doubly linked list, if it is assumed that X points to neither the first nor the last node of the list? Select one: O a. X->Fwd = X->Fwd->Fwd ; X->Fwd->Bwd = X; Ob. X->Bwd->Fwd = X->Bwd ; x->Fwd->Bwd = X->Fwd; O c. X->Bwd->Fwd = X->Fwd: X->Fwd->Bwd = X->Bwd ; Od X->Bwd = X->Bwd->Bwd ; x->Bwd->Fwd = X