Suppose you have a size $3$ cache initially containing items A$,$ B$,$ and C$.$ Under the Belady OPT algorithm, what items are evicted in each step in the following access pattern:

Group of answer choices

D

Evict C

A

N$/$A $($hit$)$

E

Evict B

C

Evict E

B

Evict C

A

N$/$A $($hit$)$

D

N$/$A $($hit$)$

E

Evict A

D

N$/$A $($hit$)$

B

N$/$A $($hit$)$