Suppose that you have a singly linked list with five nodes and with head reference. Then the statement head = head.next will remove the first node of the linked list? a) true  b) false

You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this homework.  The “data.txt” file has three lines of data  100, 110, 120, 130, 140, 150, 160  100, 130, 160  1@0, 2@3, 3@END  You need to   1. create an empty unsorted list  2. add the numbers from the first line to list using putItem() function.   Then print all the current keys to command line in one line using printAll().  3. delete the numbers given by the second line in the list by using deleteItem() function.  Then print all the current keys to command line in one line using printAll()..   4. putItem () the numbers in the third line of the data file to the corresponding location in  the list. For example, 1@0 means adding number 1 at position 0 of the list.  Then print all the current keys to command line in one…

//No need for the whole code //just the methods please for both   Write a recursive method “int sumPos(Node head)” to calculate the sum of positive integers in a linked list of integers referenced by head.  No global variables are allowed.  Node is declared as: Node {       int value;       Node next; } Write a non-recursive method “int sumPos(Node head)” to calculate the sum of positive integers in a linked list of integers referenced by head.  No global variables are allowed.  Node is declared as: Node {       int value;       Node next; }

The for construction is a loops that iteratively processes a given list. Consequently, it works so long even though there are objects to process. What about this claim: true or false?