Let S = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } . What is the smallest integer K such that any subset of S of size K contains two disjoint subsets of size two, { x 1 , x 2 } and { y 1 , y 2 } , such that x 1 + x 2 = y 1 + y 2 = 9?
(a) 8 (b) 9 (c) 7 (d) 6 (e) 5
answer of is cPLEASE explain how to solve it.?????

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Thanks a lot this solution is very helpful😀

You're welcome! :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.