Let fn be a sequence of nonnegative integers satisfying the recurrence
relation fn = (n³-3n²+2n) fn-3, as well as fi = 1, f2 = 2, and f3 =6. Prove by strong induction that fn = n! holds for all integers n ≥ 1.