Create a sequence from the following explicit formula. Then, write the recursive formula from the sequence. f (n)=2(n)+2 A {4,6,8,10,...} where f(1)=4 and f(n)=f(n−1)+2.
B {4,6,8,10,...} where f(1)=4 and f(n)=f(n−1)+4
C {4,6,8,10,...} where f(1)=2 and f(n)=f(n−1)+2
D {4,6,8,10,...} where f(1)=2 and f(n)=f(n−1)+4

An unknown number x is at most 10. which graph best represents all the values of x? number line graph with closed circle on 10 and shading to the right. number line graph with open circle on 10 and shading to the right. number line graph with open circle on 10 and shading to the left. number line graph with closed circle on 10 and shading to the left.