Carlos wants to write a computer program that produces the sequence that can be defined by the general term tn = n!, where n ∈N and n ≥ 1. For example, t1 = 1, t2 = 2 × 1, t3 = 3 × 2 × 1, t4 = 4 × 3 × 2 × 1, and so on. Unfortunately, the computer programming language that he is using doesn’t understand the factorial symbol. It only understands recursive formulas. Formulate a recursive formula can Carlos use in his computer program to produce the sequence.