1. (10 pts) Consider a linked list of items that are in no particular order. Assume the linked list has a head reference and a tail reference. a. Write instructions to insert a node referenced by newNode at the end of the linked list. You shouldn't use a loop. b. Write instructions to delete a node referenced by newNode at the end of the linked list. Note that the first step to solve this problem is to identify all possible cases, including inserting into an empty linked list, deleting from a linked list with zero or one node, and so on. Drawing pictures helps