A stack 'S' of size (1 to N) and the initial position of top pointer is 0.
get(i, S) is a routine to get ith element from stack ‘S’ with respect to top.
Then, what is the underflow condition on stack to perform get() operation.1
top – i < N
2
top – i + 1 ≤ N
3
top – i ≤ 0
4
top – i + 1 ≤ 0