Which of the following could be counted by calculating (n)? (Check The number of n-element subsets of the set [1, 2, 3, ..., k}. The number of ways to arrange exactly k ones in a string of n binary

 

Transcribed Image Text:

Which of the following could be counted by calculating (n)? (Check The number of n-element subsets of the set [1, 2, 3, ..., k}. The number of ways to arrange exactly k ones in a string of n binary digits. The number of bit strings of length k and weight n. The number of k-element subsets of the set (0, 1, 2, .. n-1).

• Expert Answer