Given is the following directed graph:

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?$

Entry at $3$ and finish at $8$

Entry at $4$ and finish at $7$

Entry at $9$ and finish at $10$

Entry at $3$ and finish at $5$

Prim's Algorithm is classified as a "Greedy Algorithm". Looking at the algorithm in pseudo$-$code, indicated the line that is indicative of the greedy approach taken.Answer with just a number between $1$ and $13,$ no surrounding white space or other characters.