Question $3$:

$[10$ marks$]$

Find the shortest path from vertex $\text{'}$s$\text{'}$ to all the other vertices of the graph shown in figure $3$ using Dijkstra's algorithm $($or find shortest $D[a],D[b],D[c],D[d],D[e]$ and $(a),(b),(c),(d),(e).$ Show your work $($step by step$)$ for full credit.