in a linked list implementation of stack, push and pop methods have thr $\_\_\_\_\_$ time complexity respectively. $$O$($n$),$O$($n$)$ O$($n$),$ O$(1)$ O$(1),$O$(1)$ O$(1),$ O$($n$)$