Coefficient Matrix
\[ A = \begin{bmatrix} 1 & 2 & 2 \\ 5 & 1 & 3 \end{bmatrix} \]
\[ \text{rank}(A) = 2 \]
Check the Augmented Matrix
\[ [A \mid b] = \begin{bmatrix} 1 & 2 & 2 & b_1 \\ 5 & 1 & 3 & b_2 \end{bmatrix} \]
Apply \( R_2 \rightarrow R_2 - 5R_1 \):
\[ \begin{bmatrix} 1 & 2 & 2 & b_1 \\ 0 & -9 & -7 & b_2 - 5b_1 \end{bmatrix} \]
For any values of \( b_1 \) and \( b_2 \):
\[ \text{rank}[A \mid b] = 2 = \text{rank}(A) \]
So the system is always consistent (never has no solution).
Count Free Variables
\[ \text{Free variables} = n - \text{rank}(A) = 3 - 2 = 1 \]
Answer: Option 2
\[ \boxed{\text{The system will have infinitely many solutions for any given } b_1 \text{ and } b_2} \]
Reason: 2 equations, 3 unknowns, \( \text{rank}(A) = 2 \) → always 1 free variable → always infinitely many solutions regardless of \( b_1 \) and \( b_2 \).