The number of exchanges in the selection sort is (N-1) and the number of comparisons is given by (N-1) + (N-2) + (N-3)+ .... +3 +2 +1. Use the Big O to estimate the total number of comparisons, if a) The sequence to be sorted is represented by single array of N values b) The sequence to be sorted is represented by double array of N times N values (each element of the array represents another array)