The following table contains the first iteration of a Dijkstra's algorithm solution to a shortest path problem.

By looking at the table with the information worked out in such iteration, we can identify that some nodes are not directly connected to the starting node. What are those nodes?

Question $1$ options:

A and F

D and F

A$,$ D$,$ and F

B$,$ C and E