A complete binary tree with n $=4$ levels has how many leaves. Root starts from level $0$

ered

a$.25$

ed out of

b$.32$

g question

c$.31$

d$.$ Can Vary

e$.16$