Suppose two cookie jars each have 25 cookies and whenever Cookie Monster gets hungry, he selects a cookie uniformly at random from either one. We are interested in computing the chance of one jar being close to empty when the other is eaten entirely. Let C denote the number of cookies left in a jar when the other jar becomes empty. Find the probability that there are k cookies left, that is what is P(C=k)?

345(67)

Step-by-step explanation:

eat hte cookies hehe

step-by-step explanation:

i dont get

step-by-step explanation:

y = | -2(-2) |     →     y = | 4 |     →     y = 4       ⇒   (-2, 4)

y = | -2(-1) |     →     y = | 2 |     →       y =   2       ⇒   (-1, 2)    

y = | -2(0) |     →     y = | 0 |     →       y = 0         ⇒   (0, 0)

y = | -2(1) |   c →     y = | -2 |     →     y =   2         ⇒   (1, 2)    

y = | -2(2) |     →     y = | - 4 |     →     y =   4         ⇒   (2, 4)