Which of the following scenarios has the worst runtime complexity, where the problem size is the number of elements stored in a singlylinked list defined by both its head and tail instance fields? Hint: Drawing a diagram of a chain of singly linked nodes with head and tail references will help you answer this question correctly. Adding a new element at index 0 of the list. Adding a new element at index size of the list. Adding a new element at index size-1 of the list.
