in java

Implement the Doubly Linked List, and do the following operations:

$1-[20\%]$ Create the Node class $($Data$,$ Previous, Next$)$

$2-[60\%]$ Create Doubly Linked List $-$ DLL to do :

a$-$ add new nodes $($@ Last$),$

b$-$ delete the last node,

c$-$ traverse the Linked List Forward and backward.

$3-[20\%]$ Test the class and create a LinkedList of $3$ nodes, delete the last node, add a new node to the end, and print the LL backward and Forward.