142) The number of possible commutative binary operations that can be defined on a set of n elements (for a given n) is

143) The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is

144) The average successful search time taken by binary search on a sorted array of 10 items is

145) The average successful search time for sequential search on 'n' items is

146) The running time of an algorithm T(n), where 'n' is the input size, is given by T(n) = 8T(n/2) + qn, if n>1 Where p,q are constants. The order of this algorithm is