Select the statements that are true for Dijkstra's algorithm.

$-$the second vertex that is closed by the algorithm must be adjacent to the start vertex

$-$a vertex u is added to open, the first time u$\text{'}$s distance estimate is updated to a finite value

$-$it finds shortest paths from a source to all vertices other than source

$-$it finds shortest paths from every vertex to every vertex

$-$all vertices are closed at the end

$-$all edge weights are non$-$negative

$-$the graph is acyclic

$-$a vertex must be added to open before it is closed

$-$the graph must be directed