Please Solve this assignment, code in JAVA, $($Data Structure Course$)$ Linked List Operations

Objective: To implement various operations on a linked list in Java.

Tasks:

$1.$ Implement a linked list class with the following methods: a$.$ Insert at the beginning of the list. b$.$ Insert at the end of the list. c$.$ Insert before a given node. d$.$ Insert after a given node. e$.$ Delete the first node. f$.$ Delete the last node. g$.$ Delete a specific node. h$.$ Search for a node by value. i$.$ Display the list.

$2.$ Implement a menu$-$driven program where users can choose from the available operations and perform them on the doubly linked list.

$-$ Pprovide clear and concise prompts for user input and feedback on the outcome of each operation.

$---$ Linked List Operations $---$

$1.$ Insert at the beginning

$2.$ Insert at the end

$3.$ Insert before a node

$4.$ Insert after a node

$5.$ Delete the first node

$6.$ Delete the last node

$7.$ Delete a specific node

$8.$ Search for a node

$9.$ Display list

$10.$ Exit

Enter your choice: