help with C++ please

Substituting these formulas, the Newton-Raphson update rule for computing the n' root of any value K is: 2+1 = - na"-T Write a program that includes a user-defined function named root that will calculate and return the nth root of any value using the Newton-Raphson method described above: double rootN(double x, int n); The function takes two arguments: a (type double) value > 0 and an integer root > 1. This function should work exactly as your Babylonian square root, but using the more generalized update rule. Do not use any math library functions in your solution. [Hint: it will be very helpful if you also construct a separate function to computex"] Your main program should take as input positive values for K and n, then call the rootN function to determine and display the root of the input value. Include a continuation loop that will continue this process as long as the user wishes. Examples: enter value and root: 92 the root is: 3.00002 continue? (y): y enter value and root: 93 the root is: 2.08008 continue? (y): y enter value and root: 94 the root is: 1.73207 continue? (y): n