Please photo print the solution if you can.

Consider the function f (n) = 5f (n - 1) - 6f (n - 2), n greaterthanorequalto 2, f (0) =0, f (1) = 1. Write a program that calculates f (n) recursively. At the start of the program, prompt the user to input an integer number by printing " Input an integer; ". If the input is negative, then print "Input must be nonnegative. ". If the invite is nonnegative, then print the value of f (n) as "f () = ", where mid are replaced with the vides of n and f (n), respectively. You should use the following function prototype: int recursive Funk (int n); Example input/output pairs (without the prompt) are provided below. (a) Input: 0; Output: f (0) =0 (b) Input: 1; Output: f(l) = 1 (c) Input: 3; Output: f(3) = 19<><>