Answer:
See explaination for program code.
Explanation:
C++ programming language is a powerful general-purpose programming language. It can be used to develop operating systems, browsers, games, and so on.
C++ supports different ways of programming like procedural, object-oriented, functional, and so on. This makes C++ powerful as well as flexible.
Please kindly refer to attachment for a C++ programming code that performs the operation.
Answer:
There are 5,598,527,220 ways to choose <em>5</em> cards of type 1, <em>4 </em>cards<em> </em>of type 2, <em>2</em> cards of type 3 and <em>2</em> cards of type 4 from a set of 13 cards.
Explanation:
The <em>crucial point</em> of this problem is to understand the possible ways of choosing any type of card from the 13-card deck.
This is a problem of <em>combination</em> since the order of choosing them does not matter here, that is, the important fact is the number of cards of type 1, 2, 3 or 4 we can get, no matter the order that they appear after choosing them.
So, the question for each type of card that we need to answer here is, how many ways are there of choosing 5 cards of type 1, 4 cards of type 2, 2 cards of type 3 and 2 are of type 4 from the deck of 13 cards?
The mathematical formula for <em>combinations</em> is , where <em>n</em> is the total of elements available and <em>k </em>is the size of a selection of <em>k</em> elements from which we can choose from the total <em>n</em>.
Then,
Choosing 5 cards of type 1 from a 13-card deck:
, since
.
Choosing 4 cards of type 2 from a 13-card deck:
, since
.
Choosing 2 cards of type 3 from a 13-card deck:
, since
.
Choosing 2 cards of type 4 from a 13-card deck:
It is the same answer of the previous result, since
.
We still need to make use of the <em>Multiplication Principle</em> to get the final result, that is, the ways of having 5 cards of type 1, 4 cards of type 2, 2 cards of type 3 and 2 cards of type 4 is the multiplication of each case already obtained.
So, the answer about how many ways can we choose 13 cards so that there are 5 of type 1, there are 4 of type 2, there are 2 of type 3 and there are 2 of type 4 is:
1287 * 715 * 78 * 78 = 5,598,527,220 ways of doing that (or almost 6 thousand million ways).
In other words, there are 1287 ways of choosing 5 cards of type 1 from a set of 13 cards, 715 ways of choosing 4 cards of type 2 from a set of 13 cards and 78 ways of choosing 2 cards of type 3 and 2 cards of type 4, respectively, but having all these events at once is the <em>multiplication</em> of all them.