Answer Happy

Select the best answer from the supplied choices: A simple implementation of the disjoint-set data structure involving linked lists was discussed in class. We illustrate how the sets si={f, g, d) and sz={c, h, e, b} would be represented and how their union s =s Us, would be represented (one of them, $2, is removed as the sets have to be disjoint): head head S1 S2 S1 If the sets participating in a UNION(...) had lengths that were O(n), what would be the time complexity of UNION(..) in this implementation as a function of n? Select one: O a. O(n) Ob. O(n lg n) O C. O(lg n) od 0(1) Oe. O(n)