Consider the function f: NXNXN - N, (n1, n2, n3) - ni + 12 + 13. Thus, A(n) = #f-({n) ) is the number of possibilities of writing n as a sum nj + n2 + n3. Prove that for all n E N, A(n) = (n - 1)(n - 2) 2