1. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a breadth first search starting from vertex C? Remember to select unvisited neighbors in lexicographical order. 2. (2 points) Draw the BFS produced by starting at vertex G in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. 3. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a depth first search starting from vertex B? Remember to select unvisited neighbors in lexicographical order. 4. (2 points) Draw the DFS produced by starting at vertex E in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. Figure 1 Graph for BFS and DFS Problems A B C D A E F G H I 5. (2 points) Give an ordering of the vertices resulting from a Topological Sort of the graph shown in Figure 2.

1. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a breadth first search starting from vertex C ? Remember to select unvisited neighbors in lexicographical order. 2. (2 points) Draw the BFS produced by starting at vertex G in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. 3. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a depth first search starting from vertex B ? Remember to select unvisited neighbors in lexicographical order. 4. (2 points) Draw the DFS produced by starting at vertex E in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. Figure 1 Graph for BFS and DFS Problems 5. ( 2 points) Give an ordering of the vertices resulting from a Topological Sort of the graph shown in Figure 2. Figure 2 Graph for Topological Sort Problem What to Turn In Submit a single RDF file through Blackboard containing your answers. Please note that no other file format will be accepted (i.e., JPG, PNG, etc.) 1. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a breadth first search starting from vertex C ? Remember to select unvisited neighbors in lexicographical order. 2. (2 points) Draw the BFS produced by starting at vertex G in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. 3. (2 points) In what order will the vertices of the graph shown in Figure 1 be visited when performing a depth first search starting from vertex B ? Remember to select unvisited neighbors in lexicographical order. 4. (2 points) Draw the DFS produced by starting at vertex E in Figure 1. Remember to select unvisited neighbors in lexicographical order. In your drawing, the vertices should be arranged the same as in my drawing. Figure 1 Graph for BFS and DFS Problems 5. ( 2 points) Give an ordering of the vertices resulting from a Topological Sort of the graph shown in Figure 2. Figure 2 Graph for Topological Sort Problem What to Turn In Submit a single RDF file through Blackboard containing your answers. Please note that no other file format will be accepted (i.e., JPG, PNG, etc.)