What is the meaning of this statement: "A stack data structure has a Last$-$In$,$ First$-$Out property"?

A$.$ the last object on the stack has the greatest value and the first object on the stack has the smallest value

B$.$ the last object on the stack has the smallest value and the first object on the stack has the greatest value

C$.$ the last object popped off the stack is the first object popped off the stack

D$.$ the last object pushed on the stack is the first object popped off the stack

E$.$ none of the above