The only way to learn counting is to practice, practice, practice, so here is your chance to do so. for this problem, you do not need to show work that justifies your answers. we encourage you to leave your answer as an expression (rather than trying to evaluate it to get a specific number). (a) how many ways are there to arrange n 1s and k 0s into a sequence? (b) a bridge hand is obtained by selecting 13 cards from a standard 52-card deck. the order of the cards in a bridge hand is irrelevant. how many different 13-card bridge hands are there? how many different 1

For a binary string of k zeros and n ones we choose n of them to be ones:

Bridge hands, we choose 13 of 52

c: y > - 1/6x + 1

step-by-step explanation:

dashed line - meaning this < or > also not equal

solid line - meaning this < or > also equal

your answer is c because y > means up & it's shaded up, but y < means down

hope this ! : )

b. 1.25 hr

step-by-step explanation:

if you have a constant speed of 60 mph, then you have a ratio between 60 mi. to 1 hr. dividing both sides by 60 we get the ratio

1 mi. to

then mult. both sides by 75 we get the ratio

75 mi. to

simplifying we get

75 mi. to

or 1.25 hr.