5(7+3) {Sorry I’m asking so many questions but I’m really struggling with my home work}

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

How do you solving the solution of each system using elimination?

The graph and table shows the relationship between y, the number of words jean has typed for her essay and x, the number of minutes she has been typing on the computer. according to the line of best fit, about how many words will jean have typed when she completes 60 minutes of typing? 2,500 2,750 3,000 3,250