1. (20 Points) Let G = (V, E) be a graph with n vertices. Give a linear time algorithm that checks whether there is a path between all vertex pairs (u, v) in G; i.e., either u is reachable from V, v reachable from u or both