Which of the following scenarios represents a graph that cannot be a tree?
A connected graph with V=5V=5V=5 and E=4E=4E=4.
A graph with V=6V=6V=6 and E=5E=5E=5 that contains a cycle.
A graph with V=4V=4V=4 and E=3E=3E=3 that is connected.
A connected graph with V=10V=10V=10 and E=9E=9E=9.