4)Rudy collects baseball cards, and he currently has 300 cards. Starting tomorrow, he will purchase 1 pack of 15 baseball cards every day, and every pack he purchases will contain 1 card of a member of his brother’s favorite team. Every time Rudy purchases a pack of cards, he will immediately trade the card of the member of his brother’s favorite team to his brother for 3 cards of members of a different team. Which of these recursive formulas produces the sequence that represents the number of baseball cards that Rudy will have at the end of each day, starting today?

A) t1 = 300, tn = tn-1 + 17, where n ∈ N and n > 1

B) t1 = 315, tn = tn-1 + 18, where n ∈ N and n > 1

C) t1 = 317, tn = tn-1 + 17, where n ∈ N and n > 1

D) t1 = 318, tn = tn-1 + 17n, where n ∈ N and n > 1

WILL GIVE BRANLIEST IF RIGHT