Concept:
A MOD-N counter requires a number of flip-flops such that:
\[
N \leq 2^n
\]
where $n$ is the number of flip-flops.
Step 1: Given MOD value.
\[
N = 16
\]
Step 2: Find minimum $n$.
\[
2^n \geq 16
\]
\[
2^4 = 16
\]
Step 3: Conclusion.
Thus, 4 flip-flops are required.