Given the following DFS algorithm and the graph. Assume E is the starting vertex, which vertices are in visitedSet after the first iteration of the while loop?

DFS$($startv$)\{$

Push startv to stack

while $($ stack is not empty $)\{$

currentV $=$ Pop stack

if $($ currentv is not in visitedset$)\{$

"visit" currentV

Add currentv to visitedset

for each vertex adjv adjacent to currentv

Push adjv to stack

$\}$

$\}$

$\}$

E

E$,$ C$,$ B$,$ D$,$ A

C$,$ B$,$ D

E$,$ C$,$ B$,$ D