Select the correct big O execution times $($accounting for amortization when necessary$)$ for:

The dynamic array$-$based stack$/$queue$/$deque operations $($with the upsizing strategy only, and no circular buffer$).$

The doubly linked list $($with both front and back sentinels$)$ stack$/$queue$/$deque operations.

Select the correct answer from the drop$-$down for each method:

Dynamic Array

Push:

Pop:

Enqueue:

Dequeue:

Add$\_$Front:

Add$\_$Back:

Remove$\_$Front

$/$ Remove$\_$Back:

Doubly Linked List

Push:

Pop:

Enque$$

Dequeue:

Add$\_$Front:

$/$ Add$\_$Back:

Remove$\_$Front:

$/$ Remove$\_$Back: