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 (Assuming stack is implemented efficiently)? 00 Select one: O A. O(1) for insertion and O(n) for deletion OB.O(1) for insertion and O(1) for deletion OC. O(n) for insertion and O(1) for deletion O D.O(n) for insertion and O(n) for deletion