Question

Today Renee purchased a new MP3 player, and she uploaded 1 song onto it. Tomorrow she plans to add 1 more song, and every day thereafter, she plans to add 1 new song per day. If Renee’s MP3 player plays her songs in random order, which recursive formula will produce the sequence that represents the number of possible orders of the songs each day, starting with today?
A) t1 = 1, tn = n – tn – 1, where n ∈N and n > 1
B) t1 = 1, tn = n + tn – 1, where n ∈N and n > 1
C) t1 = 1, tn = n × tn, where n ∈N and n > 1
D) t1 = 1, tn = n × tn – 1, where n ∈N and n > 1

Answer 1

Answer: the answer is really D...

Step-by-step explanation:

Answer 2

Based on the options given, the most likely answer to this query is 

C) t1 = 1, tn = n × tn, where n ∈N and n > 1 



Thank you for your question. Please don't hesitate to ask in Brainly your queries.