A stack of size (1 to N) and the initial position of top pointer is 0.
get(i,S) is aroutine to get ith element from stack 'S' with respect to top.
then,what is the underflow condition on stack to perform get() operation?
$A) top-i<N$
$B) top-i+1<=N$
$C) top-i<=0$
$D) top-i+1<=0$