in c++ Write a recursive function called Fibonacci that takes a position in the sequence as it's parameter, then return the value in the sequence at this given position. Here is the starting of the sequence: 0 1 1 2 3 5 8 13 21 The number is found by adding up the two numbers before it. Write a recursive function hasEven that returns true if the integer parameter contains an even digit, false otherwise. Exercise: Write a recursive function countEven that returns the count of even digits in the integer parameter. Write a recursive function printStar that prints all the digits of the integer parameter, with a * in between each digit.