A student implementing a linked list wrote this method: 1 bool LinkedList::Remove(int e) { 2 1: for (Node *ptr = _head; ptr != nullptr; ptr ptr->next) %3D 3 1 if (e ptr->element) { 4. Node *deleteMe; 6. deleteMe ptr->next; ptr->next->element; ptr->next->next; %3D 7 ptr->element ptr->next delete deleteMe; %3D 8. %3D 9. 10 return true; } } return false; 11 12 13 14 } The student tested it with this linked list: head nullptr Strangely he found that it worled perfectly except it crashed with a segmentation fault for only one value. What was the value of e that made it crash? What was the number of the line where it crashed?

JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java: