Given the following set of operations, show the final disjoint set tree for each of the following union strategies. union(A, D), union(C, B), union (F, E), union (G, D), union(F, A), find(A), union(H, E), union(E, G), find(E) a. Arbitrary, where the set specified first in the union will always be the root of the combined set. b. Union by size. When the sets are the same size, the set with a root that is closer to the beginning of the alphabet should be the root of the merged set. c. Union by height. When the sets are the same height, the set with a root that is closer to the beginning of the alphabet should be the root of the merged set. d. Arbitrary with path compression. The set specified first in the union will always be the root of the merged set.