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$?

(01.02 mc) asap plzzzwhich of the following correctly simplifies the expression 3 to the power of 2 multiplied by 5 to the power of 0 whole over 4, the whole squared.? select one: a. 3 to the power of 2 multiplied by 1 whole over 4, the whole squared. = 3 to the power of 1 multiplied by 1 squared over 4 squared. = 1 over 6.b. 3 to the power of 2 multiplied by 0 whole over 4, the whole squared. = 3 to the power of 4 multiplied by 0 over 4 squared. = 0c. 3 to the power of 2 multiplied by 0 whole over 4, the whole squared. = 3 to the power of 1 multiplied by 0 over 4 squared. = 0d. 3 to the power of 2 multiplied by 1 whole over 4, the whole squared. = 3 to the power of 4 multiplied by 1 squared over 4 squared. = 81 over 16.