Dijkstra$$s Shortest Path Algorithm: $-$ Consider the two undirected graphs G$1($left$)$ and G$2($right$),$ respectively, shown here: $($a$)$ For graph G$1,$ will we search the entire graph starting from node $0.$ At the end of each loop iteration, indicate which nodes have been visited, what is the lowest total distance currently known for each node, and what is the best path known so far to each node. $($b$)$ For graph G$2,$ will we search the entire graph starting from node $0.$ At the end of the algorithm, indicate the lowest total distance currently known for each node, and what is the best path known so far to each node. Best..