I'm struggling on these 2 problems:
How many 16 bit strings are there containing six 0's and ten 1's with no consecutive 0's?
How many 8 bit strings with exactly 2 1's are there such that the 1's are not adjacent?
For the first one, I am guessing they must alternate between 0 and 1 but I have no clue how to set this up. How can I use combinations to find this?