Assume that there are 16 nodes marked 0 through 16. Initially each element should be in a separate equivalence class. Hand draw the resulting trees for each input pair when you use the weighted quick-union for the sequence 1-2, 3-4, 3-5, 1-7, 3-6, 8-9, 1-8, 3-10, 3-11, 3-12, 3-13, 14-15, 16-0, 14-16, 1-3, 1-14.