Question $1212$ pts

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:

O$(1)$

Pop:

O$(1)$

Enqueue:

O$($n$)$

Dequeue:

O$(1)$

Add$\_$Front:

O$($n$)$

$/$ Add$\_$Back:

O$($n$)$

Remove$\_$Front:

O$($n$)$

$/$ Remove$\_$Back:

O$(1)$

Doubly Linked List

Push:

O$(1)$

Pop:

O$(1)$

Enqueue:

O$(1)$

Dequeue:

O$(1)$

Add$\_$Front:

O$(1)$

$/$ Add$\_$Back:

O$(1)$

Remove$\_$Front:

O$(1)$

$/$ Remove$\_$B