To solve these problems you will use indicator random variables.

Edge processed Collection of disjoint sets initial setsa} (b,d) (e,g) (a,c) la] la] a,c [b,d) a,c [b,d) a,b,c,d) [a,b,c,d) [a,b,c,d) [b,d) lc) [b,d c) e,g) (a,b) j) (b.c) Figure 21.1 (a) A graph with four connected components: {a, b, c, d), {e, f, g), {h, i), and (b) The collection of disjoint sets after each edge is processed. Edge processed Collection of disjoint sets initial setsa} (b,d) (e,g) (a,c) la] la] a,c [b,d) a,c [b,d) a,b,c,d) [a,b,c,d) [a,b,c,d) [b,d) lc) [b,d c) e,g) (a,b) j) (b.c) Figure 21.1 (a) A graph with four connected components: {a, b, c, d), {e, f, g), {h, i), and (b) The collection of disjoint sets after each edge is processed