Match the worst time complexity to linked list operations. Deleting the last node of a singly linked list, given this list has both head and tail indicators point to the first and last node respectively. Insert a node at the second position in the singly-linked list. 1. O(1) Inserting a node before the head of a singly linked list. 2. O(logn) 3. On) Inserting a node after the end of a singly linked list, given this list only has a head without a tail indicator 4. O(n) 1. O(1) > Inserting a node before the head of a singly linked list. 2. Ollogn) 3. On) Inserting a node after the end of a singly linked list, given this list only has a head without a tail indicator 4. O(na) Deleting the node at the head of a singly linked list. Insert a node before the tail as the second last node in the singly-linked list