7. Using node 1 as the root, perform a BFS for node 6. Detail the operations clearly. 8. Using node 5 as the root, perform a DFS for node 2. Detail the operations clearly. 9. a) What are cycles in a graph? b) What problem does this present for DFS or BFS search algorithms? c) What is the solution to this problem? 10. Give the pseudo code for a program to perform a Depth First Search of a non-directed graph. Be sure the graph is represented as an adjacency list. Carefully include all the steps for this algorithm..