i. When is it better to use an adjacency list to represent a graph rather than using an adjacency matrix? Explain your reasoning. ii. Explain why a binary min heap is used in Dijkstra's algorithm. iii. Consider the following weighted, undirected graph: B 3 1 4 2 6 E 3 By hand, go through an implementation of Dijkstra's algorithm on this graph to find the shortest path between nodes A and B. Your implementation should produce both the path's length and the nodes in it. Activate Window Go to Settings to activa