Find f(1), f(2), f(3) and f(4) if f(n) is defined recursively by f(0)=4 and for n=0,1,2,… by: (a) f(n+1)=1f(n)

Girardo is using the model below to solve the equation . girardo uses the following steps: step 1 add 4 negative x-tiles to both sides step 2 add 1 negative unit tile to both sides step 3 the solution is which step could be adjusted so that gerardo's final step results in a positive x-value? in step 1, he should have added 4 positive x-tiles to both sides. in step 1, he should have added 3 negative x-tiles to both sides. in step 2, he should have added 4 negative unit tiles to both sides. in step 2, he should have added 1 positive unit tile to both sides.

Bernice paid $162 in interest on a loan of $1800 borrowed at 6%. how long did it take her to pay the loan off?

Quick graph the line for y+2=32(x+4) on the coordinate plane. does anyone know the cordinates will mark brainliest.