Question 1 1. A node is reachable if there is a path to it. True False Question 2 2. A digraph is strong connected when all the nodes are connected to each other. True False Question 3 3. An adjacency list is a matrix of 1's and O's where an entry of 1 means the two nodes are neighbors. True False Question 4 4. A tree is a connected forest. True False Question 5 5. A minimum spanning tree can be found using: Boruvka's algorithm Prim's algorithm Kruskal's algorithm All of the above