Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (

Question:Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (

1.O(1) for insertion and O(n) for deletion

2.O(1) for insertion and O(1) for deletion

3.O(n) for insertion and O(1) for deletion

4.O(n) for insertion and O(n) for deletion

Answer:2