Most graph algorithms involve visiting each vertex in a systematic order. The two most common traversal algorithms are Breadth First Search (BFS) and Depth First Search (DFS). Implementation: Use the Graph above, (Figure 2) to answer the following questions. 1. What type of graph is shown in Figure 2? 2. Perform a Breath First Search (BSF) on the above Graph. (Figure 2). Show the necessary steps using the sample table below. Vertex Being Visited Queue Contents After Visit Visit Sequence 9 0 2 1 8 5 6