Based on the previous problem, which of the following could be a valid claim of how to count the number ofn-bit strings that containn-1 or more 1's?

Group of answer choices

Forn 1, the number ofn-bit strings that containn-1 or more 1's is equal to 1.

Forn 1, the number ofn-bit strings that containn-1 or more 1's is equal ton-1.

Forn 1, the number ofn-bit strings that containn-1 or more 1's is equal ton.

Forn 1, the number ofn-bit strings that containn-1 or more 1's is equal ton+1.

prev problem

Consider the statement, "For all integersaandb, if the product ofaandbis even, thenais even orbis even."What would be the beginning of a proof by contrapositive of this statement?

Group of answer choices

Assume that eitheraorbare odd. We must show thatabis odd.

Assume thataandbare both odd. We must show thatabis even.

((Assume thataandbare both even. We must show thatabis even.))

Assume thataandbare both odd. We must show thatabis odd.