Question

Design and analysis of algorithms question
. Suppose we start with n sets, each containing a distinct element. a) Show that if u unions are performed, then no set contains more than u+1 elements. b) Show that at most n - 1 unions can be performed before the number of sets n becomes 1. c) Show that if fewer than (n/2) unions are performed, then at least one set with a single element in it remains. ​

Answer 1

Answer:

1.)A,Band C are connected to each other.

Explanation:

1 lng po pa follow po plsss

pa brainliest oo plssssss