2. (10 pts) Consider a circular linked list of items that are in no particular order. Assume the linked list only has a list reference that references the end of the list. For example, list b g m a. Write instructions to delete a node referenced by newNode at the beginning of the linked list. b. Write instructions to insert a node referenced by newNode at the end of the linked list. Similar to Problem 1, you should consider special cases