Prove the following lemmas :

a) There are at most 2^d nodes at depth d of a binary tree.

b) A binary tree with height h has at most 2^(h+1)-1 nodes

c) A binary tree with n nodes has height at least ceiling(lg(n+1))-1

Can someone get me started with this questions.