Work the following recursive problems. Find f(1), f(2), f(3) and f(4) if f(n) is defined recursively by f(0)-1 and n 0,1,2. 3f (n-1) 2f(n-1) f(n-1)2+f(n-1)+1 f(n)=| f(n-1)+2 f(O) = f(1) = 2 f(2) = f(3) = f(4) =