B D A E H The shortest path between two nodes is the path with the lowest weight. For example, the shortest path from A to C has a total weight of 6 and takes the path (A,B,C). (a) (2 points) What is the shortest path from A to F? Give the path and its weight. (b) (2 points) What is the shortest path from A to D? Give the path and its weight. (c) (8 points) A strongly connected component is a set of nodes such that every node can be reached by every other node. If you pick any node in the SCC, there exists a path that starts at the node, goes in a cycle through all other nodes in the SCC, and ends at the starting point. There are two SCCs in this graph. What are they? Question 6 : 10 points Reflection: We've used asymptotic complexity notation to give bounds on the runtime of an algorithm. We can also use it to give bounds on the amount of memory used by a data structure. Consider an undirected graph with N nodes and E edges. Give a tight lower bound on the amount of space used to store a) an adjacency matrix and b) an adjacency list of this graph. Briefly justify your bounds. You may assume that the amount of space used to represent a node and an edge is constant