Figure 1 shows a weighted undirected graph G, where every edge (u, v) in G is associated with an edge weight shown near the edge. (1) Assume that all edge weights in G are reset to be 1. Give your algorithm to find the shortest distance from a node to every other node based on the breadth-first search (BFS). Show how you use your algorithm to find the shortest distance from A to every other node step-by-step. If the edge weights are not all 1, for example, the edge weights are as shown in Figure 1, can you still use the same algorithm you have proposed to find the shortest distance from A to every other? Justify your answer. (2) Show how to use Dijkstra's algorithm to find the distances from A to all other nodes in details