please can any one help me these questions

(true, false) (true, false) b) Pointer i points at the first node in a list. c) Instruction first- i- next; excludes the first node from a list. d) Pointer first saves the address of the new first node for future processing. (true, false) e) Line#1 releases memory allocated for the first node. What is the job of line #2 ? (choose true or false for each option): a) Saves the address of the currently examined node into pointer j. b) Saves the address of the next node to be examined into pointer i->next. c) Excludes the node pointed by i from the list. d) Afterline#2, j->next points at the next node to be processed. e) Line#2 releases memory allocated for the current node. Which two instructions are indicated by line#32(choose one option) a) jnext new Node(item, i-next); count++; b) delete j; count- c) delete i; count--; d) i = new Node(item, i->next); (true, false) (2,5 points) (true, false) (true, false) 4. (true, false) (true, false) (true, false) (1 Point) 5. count++ 6. Draw a picture of the above list L after execution of the call L.XXx(30); (2 p 7. Write a code of the method deleteltem0 which deletes the last node (last item) from a linked list of the above type. (2.5 points) (true, false) (true, false) b) Pointer i points at the first node in a list. c) Instruction first- i- next; excludes the first node from a list. d) Pointer first saves the address of the new first node for future processing. (true, false) e) Line#1 releases memory allocated for the first node. What is the job of line #2 ? (choose true or false for each option): a) Saves the address of the currently examined node into pointer j. b) Saves the address of the next node to be examined into pointer i->next. c) Excludes the node pointed by i from the list. d) Afterline#2, j->next points at the next node to be processed. e) Line#2 releases memory allocated for the current node. Which two instructions are indicated by line#32(choose one option) a) jnext new Node(item, i-next); count++; b) delete j; count- c) delete i; count--; d) i = new Node(item, i->next); (true, false) (2,5 points) (true, false) (true, false) 4. (true, false) (true, false) (true, false) (1 Point) 5. count++ 6. Draw a picture of the above list L after execution of the call L.XXx(30); (2 p 7. Write a code of the method deleteltem0 which deletes the last node (last item) from a linked list of the above type. (2.5 points)