Part $3$: Introduction to Singly Linked List

Problem $3$:

The objective of class defined as follows:

class Node $\{$ int data;

$\}$

Node head;

for lenth $,i++$

int $v=A[1]$ :

it head $==$ null

head $=$ now $N$ ode $()$ ;

Start by setting up the Node class as follows:

Open your preferred Integrated Development Environment $($IDE$)$ or a text editor.

Create a new Java class named Node.

Define the Node class with the provided structure.

head. value $=V$

Node.current $=$ head;

elye

Node $t=$ heu Node $()$;

Now, let's implement various operations on the Linked List using the Node class.

$t.$ value $=\frac{v}{\frac{?}{?}}$ setVale $(v)$ :

head.next $=$ t$/$har$.$seinexit

Write a method named DynamicBuild such that it creates a linked list without an assumption related to the length of the linked list. When the user enters $-1$ as a value, the linked list creation should break.

Write a method called inner product that takes two linked list as an input. The function should return their inner product. If two linked lists are not the same length, you can continue to inner product till the end of the long$-$linked list and assume that the remaining values of shorter linked list are $1.$

Write a Java method called InsertList $0$ which given a list, a position and a value creates a node to store the given value and inserts this node to the given position.

Write a Java method called DeleteList$($O which given a value finds the node in the list with that value and deletes that node from the list.

Write a Java method called GetElementAtPositionO which given a list and a position value, finds the node at that position and returns the value stored in the node in that position.

Write a Java method called GetPositionOfElement $0$ which given a list and a value, finds the position of the node that stores that given value.

Describe an algorithm for concatenating two singly linked lists $L$ and $M,$ into a single list $L^{\text{'}}$ that contains all the nodes of $L$ followed by all the nodes of $M.$

Bonus: