Question 28 Assume a stack is implemented using a single linked list, and the top of the stack is the last node of the linked list. What is the time complexity of the pop() method? O 0(1) O O(n) O O(nlogn) O O(n^2) Question 29 Consider the following code: for(inti= n; i>= 1; i/= 2) { for(intj = 0; j<>