Plz help asap. i beg

Asequence {an} is defined recursively, with a1 = 1, a2 = 2 and, for n > 2, an = an-1 an-2 . find the term a241

List the sides of δrst in ascending order (shortest to longest) if: m∠r =x+28°, m∠s = 2x+16°, and m∠t = x+12

There are 3232 forwards and 8080 guards in leo's basketball league. leo must include all players on a team and wants each team to have the same number of forwards and the same number of guards. if leo creates the greatest number of teams possible, how many guards will be on each team?