Write a Java program to implement a singly linked list where each nodcontains one integer value. Ask the user about the number of nodes to be inserted. Take that number of elements and their positions $($except the first element$)$ from the user and insert the elements in the linked list in their appropriate positions. Then, print the list. Duplicate values are allowed. Now, take an element from the user, remove every occurrence of that element from the list, and print the list's remaining elements. Consider all possible cases of insertion and deletion. You can use the Java Scanner class to take inputs from the user. Do not use any Linked Listrelated in$-$built Java classes and methods. The sample input$/$ output is given below: $(20$ points$)$ Sample input$/$ output: $($User$$s inputs are shown in bold$)$ Enter the number of nodes: $5$ Enter an element: $2$ Enter an element: $12$ Enter the position: $5$ Wrong position! Enter an element: $12$ Enter the position: $1$ Enter an element: $3$ Enter the position: $2$ Enter an element: $1$ Enter the position: $4$ Enter an element: $3$ Enter the position: $4$ The elements of the linked list: $123231$ Enter a number to delete: $4$ Number is not found! Enter a number to delete: $3$ The elements of the linked list: $1221$