If $f(1)=1$ and $f(n)=f(n-1)+2$ then find the value of $f(6)$.
Answer Attempt 1 out of 2

Step 1 ：Given that \(f(1)=1\) and \(f(n)=f(n-1)+2\)

Step 2 ：We can use the given recursive formula to find \(f(6)\)

Step 3 ：First, find \(f(2)\): \(f(2)=f(2-1)+2=f(1)+2=1+2=3\)

Step 4 ：Then, find \(f(3)\): \(f(3)=f(3-1)+2=f(2)+2=3+2=5\)

Step 5 ：Next, find \(f(4)\): \(f(4)=f(4-1)+2=f(3)+2=5+2=7\)

Step 6 ：After that, find \(f(5)\): \(f(5)=f(5-1)+2=f(4)+2=7+2=9\)

Step 7 ：Finally, find \(f(6)\): \(f(6)=f(6-1)+2=f(5)+2=9+2=11\)

Step 8 ：So, \(f(6)=11\)

Step 9 ：Check the result: \(f(6)=f(5)+2=9+2=11\), which is consistent with the previous result

Step 10 ：Therefore, the final answer is \(f(6)=\boxed{11}\)