Depth$-$first search is applied starting at source node A$.$ When visiting the children of a vertex, children are visited in alphabetic order of their labels $($e$.$g$,$ visit C before D$).$ Proceeding in this fashion, what will be the entry and finishing time stamps for vertex E$?$