I need your help in doing weighted quick-Union question ( that is on P 228 in Algorithms book) I am attaching the page below. Something I require to this question is, that when you do it, please attach images of input and output because without that answer is not complete and useless. So kindly attach the images of input and output while posting the answer. Thanks

228 CHAPTER 2Fundamentals ALGORITHM 1.5 (continued) Union-find implementation (weighted quick-union) public class WeightedQuickUnionUF private int id; private intl] sz; private int count; // parent link (site indexed) // size of component for roots (site indexed) // number of components public WeightedQuickUnionUF (int N) count = N; d new int[N]; for (int i = 0; i <>