In C++

Write the definition of 2 functions: one recursive called Fibon which finds the nth element in a Fibonacci series and one non-recursive called printFibo that calls Fibon. The printFibo has an integer argument n. The pre-condition is that n is assumed to be smaller than 256. The post-condition is that printFibo prints out all the squares of the Fibonacci sequence of the first n elements.