In Figure 1, starting from node "a", please show the order of the nodes visited using a Breath First Search (BFS) to traverse the whole graph (nodes at the same tier are visited by following the alphabetic order) [0.25pt] C) . In Figure 1, starting from node "a", please show the order of the nodes visited usinga Depth First Search (DFS) to traverse the whole graph (nodes at the same tier are visited by following the alphabetic order) [0.25pt] In the weighted graph in Figure 2, please use Dijkstra algorithm to find the shortest path (including path length and the path) from source node "a to all remaining nodes. Please report the L table as shown in the lecture note [1.0 pt]