How Many Different Strings Of Binary Digits Of Length 8 Contain I Exactly 5 Ones

How do I go about solving this? Is this referring to combinatorics or permutations with working out the minimum and exact number?

For (i) I have:

C (8,5)= 8!/5!(8-5)! = 56


I have the answer 93.

I am unsure if I have this correct though?

Thanks for any help

"Order a similar paper and get 100% plagiarism free, professional written paper now!"

Order Now