Consider the following algorithm to check connectivity of a graph defined by its adjacen...

Consider the following algorithm to check connectivity of a graph defined by its adjacency matrix.

Does this algorithm work correctly for every undirected graph with n > 0 vertices? If you answer yes, indicate the algorithm’s efficiency class in the worst case; if you answer no, explain why.