7. Define a cycle in a graph. Give an example. 8. Describe the BFS and DFS graph search algorithms. 9. What is the difference between BFS and DFS? How do they operate differently? What are the advantages of one over the other? Give examples. 10. Describe the max flow algorithm. What is this used for? Give an example..