Which of the following statements about stacks and queues is true?

a. Stacks and queues can store only integers as their data.

b. A stack returns elements in the same order as they were added (first-in, first-out).

c. A queue’s remove method removes and returns the element at the front of the queue.

d. Stacks and queues are similar to lists, but less efficient.

e. The peek method allows access to the element at the bottom of a stack.