time complexity for efficiently solving the stock span problem using a stack is a)0(1)b)0(n)c)0(n^2)d)0(n/2)

What is the time complexity of the push, pop, top, and empty operations in a stack implemented using the STL std::stack?O(1) for all operationsO(log n) for all operationsO(1) for push and pop, O(n) for top and emptyO(n) for all operations

What is the time complexity of searching for an element in a stack of size n?O(n)O(1)O(log(n))O(nlog(n))O(2^n)O(n!)O(n^2)

What is the time complexity of the “push” operation onto a stack?O(n)O(1)O(log(n))O(nlog(n))O(2^n)O(n!)O(n^2)

What is the space complexity of a stack implementation using the STL std::stack in C++?O(1)O(log n)O(n)O(n log n)

What is the time complexity of push and pop operations in a stack?O(1)O(n)O(log n)O(n log n)