3. (10 points) Consider a Union-Find data structure with five elements (labeled 0 through 4). Initially every element is its own partitition (equivalence class). Show the state of the data structure (both as a forest of trees and as an array) after performing the following operations union(0,1) union(3,4) e union(0,3) 4. (10 points) Given the final state of the Union-find data structure from the previous question, what would the function find(3) return? What would the function find(1)
OR
OR