(a) An Undirected Graph (b) A Weighted Undirected Graph (c) A Digraph (d) A Weighted Digraph Figure 1: Illustration of various Graphs 2. Assuming that the vertices are traversed in lexicographical order beginning at vertex A, list the sequence of vertices in the order in which they are visited. (a) Give the breadth-first-search (BFS) and post-order depth-first search (DFS) traver- sals of the graph in Figure 1a. [10 points] (b) Give the breadth-first-search (BFS) and post-order depth-first-search (DFS) traver sals of the graph in Figure 1c. [15 points]