Given a set of six elements {A, B, C, D, E, F}, consider the following pairs of elements discovered to be equivalent in this order: (B,F), (F, C), (E, D), (B, C), (A, D), (C, D), (A, F). First construct disjoint sets of the six singleton sets, and then, for each of the equivalent element pairs, perform the find-union operation using the union-by-height heuristic and show the resulting disjoint sets:. Show all disjoint sets as trees. When merging two trees that have the same height, attach the second tree as a subtree of the first tree. If there is no change as a result of find-union, do not show the same tree but write No change instead.