A) Illustrate the array for the final forest of the previous part. Note that roots are not simply -1 when using union-by

[answerhappygod]

A) Illustrate the array for the final forest of the previous
part. Note that roots are not simply -1 when using union-by-size.
(previous problem asked "perform the following unions using
union-by-size" but I already did that part/do not need)
B) Using a set of values from 0 to 8 as separate roots,
perform the following unions using
union-by-height. Show the result of each union.
When heights are the same, make the second tree be a child of the
first tree.
C) Illustrate the array for the final forest of the
previous problem (note that roots are not simply -1 when using
union-by-height).