Please help me thank you so much! Let $f(n)$ return the number of distinct ordered pairs of positive integers $(a, b)$ such that for each ordered pair, $a^2 + b^2 = n$. Note that when $a \neq b$, $(a, b)$ and $(b, a)$ are distinct. What is the smallest positive integer $n$ for which $f(n) = 3$?

Tomas is making trail mix using granola and walnuts. he can spend a total of $12 on the ingredients. he buys 3 pounds of granola that costs $2.00 per pound. the walnuts cost $6 per pound. he uses the equation to represent the total cost, where x represents the number of pounds of granola and y represents the number of pounds of walnuts. he solves the equation for y, the number of pounds of walnuts he can buy. answer- b tomas added 6 to both sides of the equation instead of subtracting 6. just took the test