The Carson family will purchase three used cars. There are

This Combinations problem is asking for the number of ways to select 3 cars from 8 (each of the 2 models comes in 4 different colors for a total of 2 x 4 = 8 different types of cars) with the restriction that none of the selected cars be the same color.

We can treat the Carson family’s purchase as a sequence of decisions: the Carsons can initially purchase any one of the 8 cars, but once they have chosen the first car, their choice for the subsequent purchases is limited. This type of choice decision fits well into the Slot Method.
For the first choice, the family can choose from all 8 cars. After they have selected the first vehicle, they have fewer choices for the second pick because they cannot select another car of the same color. For example, if the family purchases a green Model A they cannot also purchase a green Model B. Therefore, we have eliminated both a green Model A and a green Model B from the second choice, leaving only 6 cars from which to choose.

A similar scenario occurs after the second choice, leaving only 4 cars for the final choice. Multiplying these choices together to get the total number of choices we have 8×6×4. (Don’t multiply this out yet! Save yourself some trouble by simplifying first.)

The order in which the purchases are made is not important so we must divide by the factorial of the number of choices to eliminate over-counting:

The correct answer is B