Shortest path:$$

The figure below is a network between six nodes: u$0,$u$1,$u$2,$u$3,$u$4,$and u$5.$The distances in the figure are the distances between nodes. For example: the distance between U$1$ and U$5$ is $10,$ and the distance between U$0$ and U$4$ is $16.$ Follow the Dijkstra Algorithm to find the shortest path from node u$0$ to other nodes: $1)$ provide a solution list with four columns: from$-$node, to$-$node, shortest$-$path, and minimum cumulative impedance. $2)$ Show your work in detail for each step.