How to implement a variation of the approximation algorithm in Haskell?

Question

i need help with the following exercise: I have to Implement a slight variation of the approximation algorithm in Haskell for the square root for 1/2(x + n/x).