QUESTION$\mathrm{.}1$: Consider the directed graph shown in the figure. There are multiple shortest paths between ertices $S$ and T$.$Which one will be reported by Dijkstra's shortest path algorithm?Assume that, in any iteration, the shortest path to a vertex $v$ is updated only when a strictly shorter path to $v$ is discovered.

A$)$ SDT

B$)$ SBDT

C$)$ SACDEGT

D$)$ SACET

E$)$ SACDT

what is the differences between option b and option d can you explain in a detail?