Which of these graphs is guaranteed to be a tree?
A connected graph with nnn vertices and nnn edges.
An acyclic graph with nnn vertices and n−1n-1n−1 edges.
A connected graph with nnn vertices and n−2n-2n−2 edges.
A graph with nnn vertices and no cycles.