A program needs to remember operations it performed in opposite order. What is the most convenient abstract data type $($ADT$)$ for this type of application?

a$.$

singly linked list

b$.$

binary tree

c$.$

tree

d$.$

stack

e$.$

queue