Answer:
The answer is 12
Step-by-step explanation: Hope you got it
Answer:
35 ways
Step-by-step explanation:
Alex has 9 friends and wants to invite 5 friends. Since Alex requires two of his friends who are twins to come together to his birthday party, since the two of them form a group, the number of ways we can select the two of them to form a group of two is ²C₂ = 1 way.
Since we have removed two out of the nine friends, we are left with 7 friends. Also, two friends are already selected, so we are left with space for 3 friends. So, the number of ways we can select a group of 3 friends out of 7 is ⁷C₃ = 7 × 6 × 5/3! = 35 ways.
So, the total number ways we can select 5 friend out of 9 to party come to the birthday include two friends is ²C₂ × ⁷C₃ = 1 × 35 = 35 ways

F ∪ H is defined as the set that consists of all elements belonging to either set F or set H (or both).
F ∩ H is defined as the set composed of all elements that belong to both F and H
Answer:
yes, ASA
Step-by-step explanation:
You have two angles and the included side of two triangles, so you can prove the triangles are congruent by ASA.
Moriah is correct because any number to the power of 0 will always be 1.