5. A sorting algorithm is given as below: (a) [6 points] If int [a]={25,5,25,10,11,29},b[6]; Then after calling cmpCountSort (a,b,6), what will be b? (b) [2 points] If a contains n elements, then how many times of comparison exist in the proposed algorithm? (c) [2 points] Is the proposed algorithm stable? If so, tell the reason. If not, modify it to be stable