An urn contains n red balls and m blue balls. They are withdrawn one at a time until a total of r, r ≤ n, red balls have been withdrawn. Find the probability that a total of k balls are withdrawn. Hint: A total of k balls will be withdrawn if there are r − 1 red balls in the first k − 1 withdrawals and the kth withdrawal is a red ball.

Step-by-step explanation:

Answer is in the following attachment

∠1≅∠2 by the alternate exterior angles theorem.

step-by-step explanation:

given, a ∥ b and ∠1 ≅ ∠3 .we have to prove that e ∥ f

we know that ∠1≅∠3 and that a || b because they are given. we see that by the alternate exterior angles theorem. therefore, ∠2≅∠3 by the transitive property. so, we can conclude that e || f by the converse alternate exterior angles theorem.

we have to fill the missing statement.

transitivity property states that if a = b and b = c, then a = c.

now, given ∠1≅∠3 and by transitivity property ∠2≅∠3 .

hence, to apply transitivity property one angle must be common which is not in result after applying this property which is ∠1.

the only options in which ∠1 is present are ∠1 and ∠2, ∠1 and ∠4

∠1 and ∠4 is not possible ∵ after applying transitivity we didn't get ∠4.

hence, the missing statement is ∠1≅∠2.

so, ∠1≅∠2 by the alternate exterior angles theorem.