Solve the function tables below.

Look at attachment. has all info needed. need

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

If the table of the function contains exactly two potential turning points, one with an input value of –1, which statement best describes all possible values of m? m ≥ –12 –12 < m < 4 m ≤ 4 m ≥ 4 or m ≤ –12