Say n is 8.
How would I ever solve this problem? I've Googled around and searched this site but I haven't come up with much. I'm not even looking for the answer necessarily, just the process by which I'd go about getting it.
I started by calculating the total number of bit strings of length 8 as $2^8$. From there where should I go?