Let $S$ be the set of all positive divisors of $n = 2^4 \cdot 3^2$. How many pairs of divisors $(a, b)$ can be chosen from $S$ such that $\text{gcd}(a, b) = 2^2$?