Consider the below non$-$directed graph. There are multiple paths from any node to any other node. Based on the shortest path algorithm, Dijkstra's algorithm, what is the short path from $"a"$ to $"g"?$

a$)$ a$-$c$-$e$-$g

b$)$ a$-$d$-$f$-$g

c$)a-c-f-g$

d$)$ a$-$d$-$c$-$f$-$g

e$)a-c-g$