use the c++ only

6. It is not difficult to show that 1 1 ili+1) 1 2 + 1 1 - + +...+ 6' 12' L - nin +1) n +1 So a simple C++ function which computes this sum is double f(int n) {return 1.0*n/(n+1); } Define a recursive function which computes this sum directly, without using the for- mula