Using c++

1. implement a recursive method fibo that takes an integer num as a parameter and returns the nth
fibonacci number.
2. implement a recursive method printdigits that takes an integer num as a parameter and prints its
digits in reverse order, one digit per line.
3. implement a recursive method mult that takes two integer parameters, x and y and returns their
product. (x*y = x*(y-1)+y. you should know not all computers provide 'product' as an operator. some computers can only do two operations, plus and minus)
4. write a program that tests the three methods above.