An inversion in an array a[1..n) is a pair of indices (1,7) such that i a[j]. the number of inversions in an n-element array is between 0 (if the array is sorted) and (0) (if the array is sorted backward). (a) consider a procedure countandmerge(a[1..n), m) that takes as input an array a[1..n] and an integer m such that 0