What is the minimum number of make set() and union() operations to obtain a set whose tree depth is 2? Using English letters for keys, list an example sequence of commands in the order they need to be executed as well as the resulting data structure to obtain a tree of depth 2. (Note: The union-by-rank is used, however, union uses find() internally and the path compression might be reducing the tree depth when making unions. Make sure to consider this when specifying the commands.)