HELP. I need this done. Pls explain and make it easy to understand because i do not understand

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

Which statements regarding efg are true? check all that apply.

Ineed with math stuff it involves graphs