If we use a Python list of size n to implement a stack, which

of the following index of the list should be choose as top of

the stack to get the most efficient implementation.

A$)0$

B$)$ n$-1$

C$)$ n$//2$

D$)$ n