Which statement about Disjoint Set Union is correct?

A. it exists only for directed acyclic graphs B. it typically uses a queue C. its main operations are find and union D. it bounds a function from below for sufficiently large inputs