An undirected graph has $5$ nodes and $3$ edges. Let $P$ and $Q$, respectively, be the maximum and minimum number of connected components of the graph.
If the graph has no self-loops and there is at most one edge between any pair of nodes, then which of the following conditions is always TRUE?
- $P=5, Q=2$
- $P=4, Q=2$
- $P=3, Q=2$
- $P=5, Q=3$