In lecture, we proved that any tree with n vertices must have n − 1 edges. Here, you will prove the converse of this statement. From now on, you can use this converse in the same way as you use statements from lecture. Prove that if G = (V, E) is a connected graph such that |E| = |V | − 1, then G is a tree.

Worth 100 points need the answers asap first row -x^2 2x^2 (x/2)^2 x^2 x is less than 2 x is greater than 2 x is less than or equal to 2 x is greater than or equal to 2 second row -5 -5/2 4 5 •2 is less than x& x is less than 4 •2 is less than or equal to x & x is less than or equal to 4 •2 is less than or equal to x& x is less than 4 •2 is less than x& x is less than or equal to 4