uestions (Graph NAME: NOTE: Refer to the figures on the next page. Describe the graphs in Figure 14-32. For example, are they directed? Connected? Complete? Weighted? 1. Use the depth-first strategy and the breadth-first strategy to traverse the graph in Figure 14-32a, beginning with vertex 0. List the vertices in the order in which each traversal visits 2. 3. Write the adjacency matrix and adjacency list for the graph in Figure 14-32a. 4. Draw the DFS spanning tree whose root is vertex 0 for the graph in Figure 14-33. 5. Draw the minimum spanning tree whose root is vertex 0 for the graph in Figure 14-33. 6. Give the adjacency matrix and adjacency list for the weighted graph in Figure 14-33. 7. Give the adjacency matrix and adjacency list for the directed graph in Figure 14-34. 8. Consider the graph in Figure 14-35 and answer the following: (a) Will the adjacency matrix be symmetrical?; (b) Provide the adjacency matrix; and (c) Provide the adjacency list. 9. Using the topological sorting algorithm, write the topological order of the vertices for each graph in Figure 14-37. 10. For the graph in Figure 14-38, answer the questions: (a) Draw all the possible spanning trees and (b) Draw the minimum spanning tree. 11. Trace the shortest-path algorithm for the graph in Figure 14-39, letting vertex 0 be the