What would be the asymptotic time complexity to remove a node at the end of singly linked list. If the header is initially pointing to the first node of the list? O(n) O(log n) 0 0(12) 0(1) Moving to another question will save this response, Question 15 of 1