How many different strings of binary digits of length 8 contain: (i) Exactly 5 ones? (ii) At least 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

ii)

I have the answer 93.

I am unsure if I have this correct though?

Thanks for any help