Match the worst time complexity to linked list operations.

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