For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1

• A. All Fully Connected Graphs
• B. All Empty Graphs
• C. All Bipartite Graphs
• D. None of the Mentioned