i) A binary string is a sequence of 1s and 0s E.g. 110111100101 is a binary string of length 12. In a binary string of length 50, how many ways are there to have a string with exactly 9 1s and no two 1s are adjacent?
ii) Given 50 cards with integers 1,2,3...50 printed on them, how many ways are there to select 9 distinct cards, such that no two cards have consecutive numbers printed on them?
ii) Given 50 cards with integers 1,2,3...50 printed on them, how many ways are there to select 9 distinct cards, such that no two cards have consecutive numbers printed on them?