Explain all the answers.

a$)$ Show that a full binary tree $($a binary tree where each branch$/$internal vertex has exactly two children$)$ with n vertices has $($n$+1)/2$ leaf vertices.