Check the Java code below:

Consider the definition of the singly linked list Node class that we implemented during the lectures.

Assume the node's data fields are info and link, and the info is of type int.

list, ptr and temp are reference variables of type Node.

Node list $=$ new Node$(10)$;

Node ptr $=$ new Node$(15)$;

list.link $=$ ptr;

Node temp $=$ new Node$(20)$;

ptr$.$link $=$ temp;

temp $=$ new Node$(25)$;

temp.link $=$ ptr;

ptr $=$ temp;

temp $=$ new Node$(30)$;

temp.link $=$ list.link;

list.link $=$ temp;

ptr $=$ list;

while$($ptr $!=$ null$)\{$

System.out.print$($ptr$.$getInfo$()+"")$;

ptr $=$ ptr$.$link;

$\}$

Answer the Following Questions:

Draw the structure of the linked list after every node is added or reassigned. Include the values and

the links between the nodes. Show the final structure of the linked list after all operations have been

performed. Clearly indicate how list, ptr$,$ and temp reference each node. $(2$ pts$)$

Based on the structure of the linked list after all the reassignments, what is the output when the while

loop prints the values of the nodes? $(1\mathrm{.}5$ pts $)$

Is there any node that will be eligible for garbage collection by the Java runtime? If yes, explain which

node and why it becomes eligible for garbage collection. $(1\mathrm{.}5$ pts $)$