Diijkstra's algorithm was done on a graph and the following is the result:

Select all the correct statements

The label $"4($B$)"$ on vertex $C$ means that a shortest path from $S$ to $C$ has weight $4.$

The label $"5($C$)"$ on vertex $D$ means that there is a path from $S$ to $D$ with $5$ edges.

The label $"6(D)"$ on vertex $E$ means that a shortest path from $D$ to $E$ has weight $6.$

We can get a shortest path from $S$ to $A$ by looking at the label $"2($B$)"$ on vertex $A,$ then label $"1($S$)"$ on vertex $B.$

The labels indicate that a shortest path from S to C is $S-B-C.$

S$-$B$-$A$-$C is a shortest path from $S$ to $C,$ but it is not indicated in the result from the algorithm.