**C++** to be replied using C++ please **C++***

b) Write a recursive function that takes an integer n as parameter. If n is odd, the function should update the value of n by multiplying it by 3 and adding 1. If n is even, the function should update the value of n by dividing it by 2. The process is repeated until the value of n becomes equal to 1. Further, the function should print the updated values of n and return the number of steps. Example: Updated values of n are: 10 16 The number of steps is:7