A doubly linked list is declared as C++struct Node { int Value; struct Node…

A doubly linked list is declared as

C++

struct Node {
       int Value;
       struct Node *Fwd;
       struct Node *Bwd;
);

C

// Struct definition in C
struct Node {
    int Value;
    struct Node *Fwd;
    struct Node *Bwd;
};

Java

// Struct definition in Java
class Node {
    int Value;
    Node Fwd;
    Node Bwd;
}

Python

# Class definition in Python
class Node:
    def __init__(self, value):
        self.Value = value
        self.Fwd = None
        self.Bwd = None

JavaScript

// Class definition in JavaScript
class Node {
    constructor(value) {
        this.Value = value;
        this.Fwd = null;
        this.Bwd = null;
    }
}

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 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?