Please do all parts! and explain fully. Thanks

1. (a) (2 points) In a round-robin tennis tournament with n players, every tennis player plays against every other player. Let T(n) be the total number of tennis matches taking place among the n players. Find a recurrence for T(n) and explain in words why T(n) satisfies this recurrence. (b) (2 points In a board game, players must place colored tiles in a single row. There are red 1 x 1 tiles, yellow 2 x 1 tiles, blue 2 x 1 tiles, purple 3 x 1 tiles, and green 3 x 1 tiles. Let C(n) be the number of different n x 1 colored rows that can be created using these tiles. Find a recurrence for C(n) and explain in words why C(n) satisfies this recurrence