# Question: prove by induction that the number of distinct bitstrings of...

###### Question details

Prove by induction that the number of distinct bitstrings of
length n or less is equal to 2^{n+1} - 1. (Note this
includes the case where n = 0.)

Please explain with steps.