Which data structure would be most efficient for implementing a reversible undo feature in a word processor?

A$)$ Array

B$)$ Stack

C$)$ Queue

D$)$ Linked List