Find f (1), f (2), f (3), and f (4) if f (n) is defined recursively by f (0) = 1 and for n = 0, 1, 2, . . . f left parenthesis n plus 1 right parenthesis equals f left parenthesis n right parenthesis squared plus f left parenthesis n right parenthesis