Question 7 (1 point) How can you prove a graph is a tree (not a forest)? Select all that apply Showing that it is connected and has no cycles. Showing that it is connected and has |Ep=n-1 Showing that it is connected and bipartite Showing that it has no cycles and is bipartite (but might be disconnected)