Hi, Im a computer science undergraduate and we are studying haskell as part of our course. I have a question on recursion that i'd like to receive some sort of answer to.

The question is to write a function to sum the first n terms in the series:

1/1 + 1/3 + 1/5+ .. + 1/(2n-1)

using ordinary recursion and then using accumulator recursion.

Please help!

Regards Stephanie