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. which recursive formula can carlos use in his computer program to produce the sequence?