Prove$/$argue the following: $($i$)$ The maximum number of leaves in a binary tree of depth d is $2$d$.($ii$)$ The maximum number of nodes in a binary tree of depth d is $2$d$+1-1.$