For each of the graphs below, list the order in which the vertices are visited in a breadth-first search, starting with vertex 1. If there are multiple vertices adjacent to a given vertex, visit the adjacent vertex with the lowest value first. Then repeat the process for depth-first search 3 6 10 9 8 For each of the graphs below, list the order in which the vertices are visited in a topological sort, starting with vertex 1. If there are multiple vertices adjacent to a given vertex, visit the adjacent vertex with the lowest value first. 1 3 Q 2 6