You are required to develop algorithms to implement the following methods for a doubly linked list class, DoublyLinkedList, which has a head reference$/$pointer and a tail reference$/$pointer for the list. You may use pseudo$-$code to explain your algorithms.

void insertfront$($int data$)$ : Insert a new node with the given data at the front of the list.

void insertend$($int data$)$: Insert a new node with the given data at the end of the list.

void delete$($int data$)$: Delete the first occurrence of the node with the given data from the list.

void printBackward$()$ : Print out the data items in the backward order from tail to the head of the list

Each node of the doubly linked list has the following fields:

int data: The integer value stored in the node.

Node next : A reference to the next node in the list.

Node prev: A reference to the previous node in the list.