7) Given the disjoint set array shown, what would the array look like after a find(10) if path compression is used? ____________________________________________ | -1 | 0 | 0 | 2 | 2 | 1 | 1 | 5 | 5 | 8 | 9 | -------------------------------------------- 0 1 2 3 4 5 6 7 8 9 10 10 points 8) Illustrate the trees for the final forest of the previous problem.