A stack data structure, when implemented by a programmer as a LIFO data structure, has the following property (only one correct choice): [Assume there are several items remaining in the stack when considering these options.] a. It allows the client to pop () the earliest, i. e. first, push () ed item (the oldest item in the stack).
b. It allows the client to pop () any item off the stack, based on the parameter the client passes to pop ).
c. It allows the client to pop () the most recently push () ed item (the newest item in the stack).