Upper bound with recursion tree

Question

I need to find asymptotic upper bound using recursion tree. The relation is T(n) = T(n-1) + 1/n I suppose that it is O(logn) but i cannot show it. Any suggestions?

Answer 1

Hint: take a look at the Harmonic numbers.