Find the shortest path from A to all other vertices using Dijkstra's algorithm for the graph shown below. Show the sets S$,$ V$-$S$,$ and values for Short$($i$)$ for all i in V

$\backslash$table$[[,,,$short$(i)$