combinatorics - combinatorial argument and by induction proof

Let n be a fixed natural number. Show that:
$$\sum_{r=0}^m \binom {n+r-1}r = \binom {n+m}{m}$$

(A): using a combinatorial argument and (B): by induction on $m$?