Let G be a connected graph with 7 edges. Find upper and lower bounds on the number of vertices in G. Try to make your bounds as tight as possible, i.e. find the largest possible lower bound and the smallest possible upper bound. Briefly justify your answers.