Give a combinatorial proof of:

SUM(n choose k)= SUM(n choose k)

k odd k even

Well I know that (n choose k) represents putting k identical objects into n bins.

Perhaps I can say that k= 2r+1 for the left side and k=2r for the right side for some integer r.

Any help would be great!