4. Graph Algorithms (Short Answers) (a). Write down the vertex ordering by the DFS and BFS traversals (each in one line) of the following graph. Assume the source is 5 and G is represented with a sorted adjacency list. There is no need to explain or justify your answers. (b). Write down the first five edges added by Kruskal's and Prim's MST algorithm (each in one line) of the following graph. Break ties arbitrarily. Indicate each edge with its endpoints, e.g., (A,B). There is no need to explain or justify your answers