Suppose the transitive closure of the graph G is depicted in the following diagram: 2 3 6 5 From the following list, select facts that we can deduce about the original graph G. Remember, only include facts that we can deduce with certainty. There must be an edge from vertex 1 to 2 There must be no walk from vertex 1 to 6 There must be a walk from 3 to 5 There must be no edge from vertex 1 to 6 There must be a path from vertex 1 to 6 There must be an edge from 6 to 3