1.

A sub-committee of 5 members is to be selected from a group of 9 doctors and 6

nurses. How many ways can the sub-committee be formed if it must consist of
exactly 3 doctors and 2 nurses?
2. A new car model comes in 7 exterior colors, 3 interior colors, and 2 transmission
types (manual or automatic). How many different versions of this car are
possible?
3. You have 15 identical dollar bills to distribute among 4 friends. Each friend must
receive at least two dollar bills. How many ways can you distribute the bills?
4. How many distinct arrangements can be formed using the letters of the word
“MATHEMATICS”?
5. A factory produces 20 identical toy cars to be shipped to 3 different toy stores.
Each toy store must receive at least 3 toy cars. How many ways can the toy cars
be distributed?
6. In how many ways can 6 boys and 6 girls be arranged in a line if boys and girls
must alternate?
7. A donut shop offers 6 different types of donuts. If you want to buy a dozen (12)
donuts, how many different combinations of donuts can you buy? (You can
choose the same type multiple times, and the order in which you pick them
doesn't matter.)
8. There are 4 different roads from town A to town B, and 5 different roads from
town B to town C, and 2 different roads from town C to town D. How many
different ways are there to travel from town A to town D via towns B and C?
9. How many different 5-digit security codes can be formed if the first digit cannot
be 0, and repetition of digits is allowed?
10. From a standard deck of 52 playing cards, how many ways can you choose a
hand of 5 cards that contains exactly 2 queens and exactly 1 king?
11. In a beauty pageant with 12 contestants, how many different ways can the
positions of Miss Congeniality, 2nd Runner-Up, 1st Runner-Up, and Winner be
awarded?
12. There are 8 unique paintings to be hung in a row on a gallery wall. In how many
distinct orders can they be arranged?
13. A sandwich shop offers 10 different sandwich fillings. You want to choose 4
different fillings for your custom sandwich. How many different combinations of
fillings can you choose?
14. How many non-negative integer solutions are there to the equation a + b + c + d +
e = 15?
15. A school cafeteria has 25 identical fruit cups to deliver to 6 different classrooms.
Each classroom must receive at least one fruit cup. How many ways can the fruit
cups be allocated?
16. A farmer has 30 identical apple saplings to plant in 5 different orchards. Each
orchard must have at least 2 saplings. How many ways can the saplings be
planted?
17. A custom car tag consists of 2 letters followed by 4 digits.
a) How many different tags are possible if repetition of letters and digits is
allowed, and the first digit cannot be 0?
b) How many different tags are possible if repetition of letters and digits is
NOT allowed, and the first digit cannot be 0?
18. An exam has 12 questions. A student must answer 10 questions, including
exactly 3 of the first 5 questions. How many choices does the student have?
19. How many positive integer solutions are there to the equation x + y + z + w = 15?
20. A local food bank receives 24 identical bags of rice to distribute among 5
different community centers. Each center must receive at least 3 bags of rice.
How many ways can this be done?
21. You roll a standard six-sided die four times. How many sequences of rolls result
in a sum of 15? (Order matters for the rolls).
22. In how many ways can 9 identical toys be placed into 4 distinct toy boxes, such
that no box is empty?
23. You have 5 different colored beads, and you want to string them in a specific
order on a necklace. How many different arrangements can you create if you use
all 5 beads and consider arrangements distinct if they appear different when
viewed from one side (i.e., not rotating)?
24. How many distinct permutations can be made from the letters of the word
“ENGINEER”?
25. A survey has 8 "yes" or "no" questions. How many different ways can someone
answer all 8 questions?
26. How many lines can be formed by connecting any two points from a set of 9
points, no three of which are collinear?
27. A baker is preparing a large batch of 25 identical cupcakes to be sold in 5
different display cases. To ensure a presentable display, each of the 5 cases
must contain at least 3 cupcakes. How many different ways can the baker
distribute the 25 cupcakes among the 5 display cases?
28. A librarian needs to distribute 30 identical copies of a popular new novel among
4 different reading clubs. To ensure every club gets a significant share, each club
must receive at least 5 copies of the novel. How many different ways can the
librarian distribute the novels?
29. You have 18 identical mini chocolate bars to put into 3 gift bags. To make sure
each bag feels substantial, you decide that each bag must contain a minimum of
4 mini chocolate bars. In how many distinct ways can you distribute the
chocolate bars into the 3 bags?
 30. In a game show, 22 points are awarded to 6 different contestants. Each
contestant must receive at least 1 point to be considered a participant. How
many different ways can the 22 points be distributed among the 6 contestants?
31. A gardener has 40 identical flower seeds to plant across 7 different garden plots.
Due to the size of the plots, each plot must contain at least 3 seeds. How many
different ways can the gardener distribute the seeds among the 7 plots?

Here are the solutions to the second set of 26 combinatorics and probability questions:

* Combinations with Specific Criteria:

* Choose 3 doctors from 9: \binom{9}{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times
1} = 3 \times 4 \times 7 = 84.

* Choose 2 nurses from 6: \binom{6}{2} = \frac{6 \times 5}{2 \times 1} = 3 \times 5 = 15.

* Total ways = \binom{9}{3} \times \binom{6}{2} = 84 \times 15 = 1260.

* Fundamental Counting Principle:

Number of exterior colors = 7

Number of interior colors = 3

Number of transmission types = 2

 Total different versions = 7 \times 3 \times 2 = 42.

* Distribution of Identical Items with Minimums:

* Identical items (n): 15 dollar bills

* Distinct bins (k): 4 friends

* Minimum for each bin: 2 bills

* Allocate minimums: 4 \text{ friends} \times 2 \text{ bills/friend} = 8 bills.

* Remaining items (n'): 15 - 8 = 7 bills.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{7+4-1}{4-1} = \binom{10}{3}.

* Calculate: \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = 10 \times 3 \times 4 =

120.

Solutions to Combinatorics and Probability Questions (Set 2)

* Permutations with Repetition:

The word "MATHEMATICS" has 11 letters.

M appears 2 times.

A appears 2 times.

T appears 2 times.

H, E, I, C, S each appear 1 time.

Number of distinct arrangements = \frac{11!}{2!2!2!1!1!1!1!1!} = \frac{39,916,800}{2

\times 2 \times 2} = \frac{39,916,800}{8} = 4,989,600.

* Stars and Bars (Minimum Requirement):

* Identical items (n): 20 toy cars

* Distinct bins (k): 4 toy stores

* Minimum for each bin: 3 cars

* Allocate minimums: 4 \text{ bins} \times 3 \text{ cars/bin} = 12 cars.

* Remaining items (n'): 20 - 12 = 8 cars.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{8+4-1}{4-1} = \binom{11}{3}.

 * Calculate: \frac{11 \times 10 \times 9}{3 \times 2 \times 1} = 11 \times 5 \times 3 =
165.

* Arrangements with Alternating Types:

Since there are an equal number of boys and girls (6 each), the arrangement can start
with either a boy or a girl.

Case 1: B G B G B G B G B G B G

Arrange 6 boys in 6! ways.

Arrange 6 girls in 6! ways.

Total for Case 1 = 6! \times 6! = 720 \times 720 = 518,400.

Case 2: G B G B G B G B G B G B

Arrange 6 girls in 6! ways.

Arrange 6 boys in 6! ways.

Total for Case 2 = 6! \times 6! = 720 \times 720 = 518,400.

Total ways = 518,400 + 518,400 = 1,036,800.

* Combinations with Repetition (Ice Cream Variant):

* Number of items to choose (n): 12 donuts

* Number of types to choose from (k): 6 donut types

* Formula for combinations with repetition: \binom{n+k-1}{k-1} or \binom{n+k-1}{n}.

* Number of combinations = \binom{12+6-1}{6-1} = \binom{17}{5}.

* Calculate: \frac{17 \times 16 \times 15 \times 14 \times 13}{5 \times 4 \times 3

\times 2 \times 1} = 17 \times 4 \times 7 \times 13 = 6188.

* Multi-Stage Routes:

* A to B: 4 routes

* B to C: 5 routes

* C to D: 2 routes

Total ways to travel = 4 \times 5 \times 2 = 40.

* Permutations with Repetition (PIN variant):

* 5-digit code.

* First digit: 9 choices (1-9, cannot be 0).

* Remaining 4 digits: 10 choices each (0-9, repetition allowed).

* Total codes = 9 \times 10 \times 10 \times 10 \times 10 = 9 \times 10^4 = 90,000.

* Card Hands (Specific Card Counts):

* Choose 2 queens from 4: \binom{4}{2} = 6.

* Choose 1 king from 4: \binom{4}{1} = 4.

* Choose remaining cards: 5 - (2+1) = 2 cards.

* Remaining deck: 52 - (\text{4 Queens} + \text{4 Kings}) = 52 - 8 = 44 cards.

* Choose 2 cards from 44 non-queens/kings: \binom{44}{2} = \frac{44 \times 43}{2

\times 1} = 22 \times 43 = 946.

* Total ways = \binom{4}{2} \times \binom{4}{1} \times \binom{44}{2} = 6 \times 4

\times 946 = 24 \times 946 = 22,704.

* Permutations (Awarding Ranks):

This is a permutation problem as the order of awarding medals matters (Gold, Silver,
Bronze are distinct positions).

We are choosing and arranging 4 contestants from 12.

P(12, 4) = \frac{12!}{(12-4)!} = \frac{12!}{8!} = 12 \times 11 \times 10 \times 9 = 11,880.

* Simple Permutations:

Arranging 8 unique paintings in a row: 8! = 8 \times 7 \times 6 \times 5 \times 4 \times 3

\times 2 \times 1 = 40,320.

* Combinations (Choosing Items):

Choosing 4 different fillings from 10, order doesn't matter.

\binom{10}{4} = \frac{10 \times 9 \times 8 \times 7}{4 \times 3 \times 2 \times 1} = 10

\times 3 \times 7 = 210.

* Stars and Bars (Non-negative Solutions):

 Equation: a + b + c + d + e = 15.

Number of stars (n): 15.

Number of variables (k): 5.

Using the formula \binom{n+k-1}{k-1}:

Number of solutions = \binom{15+5-1}{5-1} = \binom{19}{4}.

Calculate: \frac{19 \times 18 \times 17 \times 16}{4 \times 3 \times 2 \times 1} = 19

\times 3 \times 17 \times 2 = 3876.

* Allocation with Minimums (Identical Items):

* Identical items (n): 25 laptops

* Distinct bins (k): 6 classrooms

* Minimum for each bin: 1 laptop

* Allocate minimums: 6 \text{ classrooms} \times 1 \text{ laptop/classroom} = 6

laptops.

* Remaining items (n'): 25 - 6 = 19 laptops.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{19+6-1}{6-1} = \binom{24}{5}.

* Calculate: \frac{24 \times 23 \times 22 \times 21 \times 20}{5 \times 4 \times 3

\times 2 \times 1} = 24 \times 23 \times 11 \times 7 / 6 = 4 \times 23 \times 11 \times 7 =
42,504.

* Identical Items into Distinct Bins (Minimums):

* Identical items (n): 30 apple saplings

* Distinct bins (k): 5 orchards

* Minimum for each bin: 2 saplings

* Allocate minimums: 5 \text{ orchards} \times 2 \text{ saplings/orchard} = 10 saplings.

* Remaining items (n'): 30 - 10 = 20 saplings.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{20+5-1}{5-1} = \binom{24}{4}.

* Calculate: \frac{24 \times 23 \times 22 \times 21}{4 \times 3 \times 2 \times 1} = 24

\times 23 \times 11 \times 7 / 24 = 23 \times 11 \times 7 = 1771.

* License Plate Variations (More Complex):

* Format: 2 letters, then 4 digits.

 * Letters: 26 (A-Z)

* Digits: 10 (0-9)

a) Repetition allowed, first digit cannot be 0:

* Letter 1: 26 choices

* Letter 2: 26 choices

* Digit 1: 9 choices (1-9)

* Digit 2: 10 choices

* Digit 3: 10 choices

* Digit 4: 10 choices

Total = 26 \times 26 \times 9 \times 10 \times 10 \times 10 = 676 \times 9000 =

6,084,000.

b) Repetition NOT allowed, first digit cannot be 0:

* Letter 1: 26 choices

* Letter 2: 25 choices

* Digit 1: 9 choices (1-9)

* Digit 2: 9 choices (0 and remaining 8 non-zero digits)

* Digit 3: 8 choices

* Digit 4: 7 choices

Total = (26 \times 25) \times (9 \times 9 \times 8 \times 7) = 650 \times 4536 =
2,948,400.

* Combinations (Exam Questions):

* Total questions: 12

* Must answer: 10

* Constraint: Exactly 3 of the first 5 questions.

* Choose 3 questions from the first 5: \binom{5}{3} = 10.

* Remaining questions to answer: 10 - 3 = 7.

* Remaining questions available: 12 - 5 = 7.

* Choose 7 questions from the remaining 7: \binom{7}{7} = 1.

* Total choices = \binom{5}{3} \times \binom{7}{7} = 10 \times 1 = 10.

* Positive Integer Solutions with Sum:

Equation: x + y + z + w = 15.

Since x, y, z, w must be positive integers, set x' = x-1, y' = y-1, z' = z-1, w' = w-1, where x',
y', z', w' \geq 0.

(x'+1) + (y'+1) + (z'+1) + (w'+1) = 15

x' + y' + z' + w' = 15 - 4 = 11.

Number of stars (n'): 11.

Number of variables (k): 4.

Using the formula \binom{n'+k-1}{k-1}:

Number of solutions = \binom{11+4-1}{4-1} = \binom{14}{3}.

Calculate: \frac{14 \times 13 \times 12}{3 \times 2 \times 1} = 14 \times 13 \times 2 =

364.

* Distribution with Higher Minimums:

* Identical items (n): 24 bags of rice

* Distinct bins (k): 5 community centers

* Minimum for each bin: 3 bags

* Allocate minimums: 5 \text{ centers} \times 3 \text{ bags/center} = 15 bags.

* Remaining items (n'): 24 - 15 = 9 bags.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{9+5-1}{5-1} = \binom{13}{4}.

* Calculate: \frac{13 \times 12 \times 11 \times 10}{4 \times 3 \times 2 \times 1} = 13

\times 11 \times 5 = 715.

* Sum of Dice Rolls (Ordered Outcomes):

We need to find ordered partitions of 15 into 4 parts, where each part is between 1 and
6. This is a complex stars and bars problem with upper bounds.

Let x_1, x_2, x_3, x_4 be the outcomes of the rolls. x_1+x_2+x_3+x_4 = 15, with 1 \leq
x_i \leq 6.

This is best solved using inclusion-exclusion.

Let y_i = x_i - 1, so 0 \leq y_i \leq 5.

y_1+y_2+y_3+y_4 = 15 - 4 = 11.
 Total non-negative solutions: \binom{11+4-1}{4-1} = \binom{14}{3} = 364.

Now subtract cases where y_i \geq 6.

Let A_i be the set where y_i \geq 6.

If one y_i \geq 6 (e.g., y_1 \geq 6), let y_1' = y_1 - 6.

y_1'+6+y_2+y_3+y_4 = 11 \Rightarrow y_1'+y_2+y_3+y_4 = 5.

Number of solutions for one A_i: \binom{5+4-1}{4-1} = \binom{8}{3} = 56.

There are \binom{4}{1} ways to choose which y_i is \geq 6. So, \binom{4}{1} \times 56 =
4 \times 56 = 224.

If two y_i \geq 6 (e.g., y_1 \geq 6, y_2 \geq 6), let y_1' = y_1 - 6, y_2' = y_2 - 6.

y_1'+6+y_2'+6+y_3+y_4 = 11 \Rightarrow y_1'+y_2'+y_3+y_4 = -1. No non-negative

solutions.

Since sums of 2 or more violations lead to negative remainders, there are no further
subtractions needed.

Total ways = 364 - 224 = 140.

* Identical Items into Distinct Bins (No Empty):

* Identical items (n): 9 toys

* Distinct bins (k): 4 toy boxes

* Minimum for each bin: 1 toy

* Allocate minimums: 4 \text{ boxes} \times 1 \text{ toy/box} = 4 toys.

* Remaining items (n'): 9 - 4 = 5 toys.

* Apply Stars and Bars: \binom{n'+k-1}{k-1} = \binom{5+4-1}{4-1} = \binom{8}{3}.

* Calculate: \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = 8 \times 7 = 56.

* Arrangements with Fixed Positions:

This is a simple permutation of distinct items.

Number of arrangements = 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120.

(Note: For circular arrangements where rotations are identical, you divide by n. For
necklaces where flips are also identical, you divide by 2n. However, "arranged in a
sequence on a necklace" and "viewed from one side" implies linear distinctness rather
than full circular symmetry for this problem wording).
* Distinct Permutations with Multiple Repeats:

The word "ENGINEER" has 8 letters.

E appears 3 times.

N appears 2 times.

G, I, R each appear 1 time.

Number of distinct permutations = \frac{8!}{3!2!1!1!1!} = \frac{40,320}{6 \times 2} =

\frac{40,320}{12} = 3360.

* Binary Choices:

For each of the 8 questions, there are 2 independent choices (yes/no).

Total ways = 2^8 = 256.

* Geometric Combinations (Non-Collinear):

To form a line, you need to choose 2 points. Since no three points are collinear, any
pair of chosen points will form a unique line.

Number of lines = \binom{9}{2} = \frac{9 \times 8}{2 \times 1} = 9 \times 4 = 36.

Here’s the solution to the cupcake distribution problem:

Understanding the Problem:

We have 25 identical cupcakes (stars) to be distributed into 5 distinct display cases

(bins). The key constraint is that each display case must have at least 3 cupcakes.

Applying the “Subtraction First” Strategy:

* Satisfy the Minimums: Since each of the 5 display cases must have at least 3
cupcakes, we first allocate 3 cupcakes to each of the 5 cases.

* Number of cupcakes initially allocated = 5 \text{ cases} \times 3 \text{

cupcakes/case} = 15 \text{ cupcakes}.

* Calculate Remaining Cupcakes: Subtract the allocated cupcakes from the total:

* Remaining cupcakes = 25 \text{ (total)} – 15 \text{ (allocated)} = 10 \text{ cupcakes}.

* Apply Stars and Bars to the Remainder: Now we need to distribute these 10 remaining
identical cupcakes among the 5 distinct display cases, with no further restrictions
(because the minimums have already been met).
 * Number of “stars” (n) = 10 (remaining cupcakes)

* Number of “bins” (k) = 5 (display cases)

The Stars and Bars formula for distributing n identical items into k distinct bins is
\binom{n+k-1}{k-1}.

* Number of ways = \binom{10+5-1}{5-1} = \binom{14}{4}

* Calculate the Combination:

\binom{14}{4} = \frac{14!}{4!(14-4)!} = \frac{14!}{4!10!} = \frac{14 \times 13 \times 12

\times 11}{4 \times 3 \times 2 \times 1}

= \frac{14 \times 13 \times (4 \times 3) \times 11}{(4 \times 3 \times 2 \times 1)}

= \frac{14 \times 13 \times 12 \times 11}{24}

= 7 \times 13 \times 11 (after cancelling 12/24 to ½ and 14/2 to 7)

= 91 \times 11 = 1001

Answer:

There are 1001 different ways the baker can distribute the 25 cupcakes among the 5
display cases, ensuring each case has at least 3 cupcakes.

1. Solutions:
2. Solution to Question 1: Library Book Allocation
3. * Identical items: 30 novels (n=30)
4. * Distinct bins: 4 reading clubs (k=4)
5. * Minimum requirement: Each club must receive at least 5 copies.
6. * Satisfy the Minimums:
7. Each of the 4 clubs needs at least 5 novels. So, we first allocate 4 \times 5 = 20
novels.
8. * Calculate Remaining Items:
9. Remaining novels to distribute = 30 – 20 = 10 novels.
10. * Apply Stars and Bars:
11. Now we distribute the 10 remaining novels among the 4 clubs (with no further
restrictions on the remainder).
12. Using the formula \binom{n’+k-1}{k-1}, where n’=10 (remaining stars) and k=4
(bins):
13. Number of ways = \binom{10+4-1}{4-1} = \binom{13}{3}
14. * Calculate the Combination:
15. \binom{13}{3} = \frac{13 \times 12 \times 11}{3 \times 2 \times 1} = 13 \times 2
\times 11 = 286
16. Answer: The librarian can distribute the novels in 286 different ways.

17. Solution to Question 2: Snack Pack Creation

18. * Identical items: 18 mini chocolate bars (n=18)
19. * Distinct bins: 3 gift bags (k=3)
20. * Minimum requirement: Each bag must contain at least 4 mini chocolate bars.
21. * Satisfy the Minimums:
22. Each of the 3 bags needs at least 4 chocolate bars. So, we first allocate 3 \times
4 = 12 chocolate bars.
23. * Calculate Remaining Items:
24. Remaining chocolate bars to distribute = 18 – 12 = 6 chocolate bars.
25. * Apply Stars and Bars:
26. Now we distribute the 6 remaining chocolate bars among the 3 bags.
27. Using the formula \binom{n’+k-1}{k-1}, where n’=6 (remaining stars) and k=3
(bins):
28. Number of ways = \binom{6+3-1}{3-1} = \binom{8}{2}
29. * Calculate the Combination:
30. \binom{8}{2} = \frac{8 \times 7}{2 \times 1} = 4 \times 7 = 28
31. Answer: You can distribute the chocolate bars in 28 distinct ways.

32. Solution to Question 3: Game Show Points

33. * Identical items: 22 points (n=22)
34. * Distinct bins: 6 contestants (k=6)
35. * Minimum requirement: Each contestant must receive at least 1 point.
36. * Satisfy the Minimums:
37. Each of the 6 contestants needs at least 1 point. So, we first allocate 6 \times 1
= 6 points.
38. * Calculate Remaining Items:
39. Remaining points to distribute = 22 – 6 = 16 points.
40. * Apply Stars and Bars:
41. Now we distribute the 16 remaining points among the 6 contestants.
42. Using the formula \binom{n’+k-1}{k-1}, where n’=16 (remaining stars) and k=6
(bins):
43. Number of ways = \binom{16+6-1}{6-1} = \binom{21}{5}
44. * Calculate the Combination:
45. \binom{21}{5} = \frac{21 \times 20 \times 19 \times 18 \times 17}{5 \times 4
\times 3 \times 2 \times 1}
46. = \frac{21 \times (5 \times 4) \times 19 \times (3 \times 2 \times 3) \times 17}{(5
\times 4 \times 3 \times 2 \times 1)}
47. = 21 \times 19 \times 3 \times 17 / (3 \times 2 \times 1)
48. = (21/3) \times (20/4) \times (18/2) \times 19 \times 17 \quad (\text{simplified
step-by-step})
49. = 7 \times 5 \times 19 \times 3 \times 17 = 20349
50. Answer: The points can be distributed in 20,349 different ways.

51. Solution to Question 4: Garden Plot Division

52. * Identical items: 40 identical flower seeds (n=40)
53. * Distinct bins: 7 different garden plots (k=7)
54. * Minimum requirement: Each plot must contain at least 3 seeds.
55. * Satisfy the Minimums:
56. Each of the 7 plots needs at least 3 seeds. So, we first allocate 7 \times 3 = 21
seeds.
57. * Calculate Remaining Items:
58. Remaining seeds to distribute = 40 – 21 = 19 seeds.
59. * Apply Stars and Bars:
60. Now we distribute the 19 remaining seeds among the 7 plots.
61. Using the formula \binom{n’+k-1}{k-1}, where n’=19 (remaining stars) and k=7
(bins):
62. Number of ways = \binom{19+7-1}{7-1} = \binom{25}{6}
63. * Calculate the Combination:
64. \binom{25}{6} = \frac{25 \times 24 \times 23 \times 22 \times 21 \times 20}{6
\times 5 \times 4 \times 3 \times 2 \times 1}
65. = \frac{25 \times (6 \times 4) \times 23 \times 22 \times (3 \times 7) \times (5
\times 4)}{6 \times 5 \times 4 \times 3 \times 2 \times 1}
66. = 25 \times 23 \times 22 \times 7 \times 2 (after cancelling 24/(6 \times 4)=1,
20/(5 \times 2)=2, 21/3=7)
67. = 177,100
68. Answer: The gardener can distribute the seeds in 177,100 different ways.
69.
70. A
71.