] Consider the following sequence of pairs p-q: 9-0, 3-4, 5-8, 7-2, 2-1, 5-7, 0-3, 4-2. a.[5] Show the contents of the id[] array and the number of times the array is accessed for each input pair when you use quick-find for the above sequence. b.[5] Redo (a) but use quick-union. c.[5] Redo (a) but use weighted quick-union. d.[8] Redo (a) but use weighted quick-union with path compression