standard_description: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ³ 1.
problem_activity: Task
Use the graph (for example, by marking specific points) to illustrate the statements in
(a)–(d).  If possible, label the coordinates of any points you draw.
[IMG]
$f(0) = 2$
$f(−3)=f(3)=f(9)=0$
$f(2) = g(2)$
$g(x)>f(x)$ for $x>2$


aligns: yes