Let A[1 · · · n] be an array of n elements and B[1 · · · m] an
array of m elements. We assume that m ≤ n. Note that neither A nor
B is sorted. The problem is to compute the number of elements of A
that are smaller than B[i] for each element B[i] with 1 ≤ i ≤ m.
For example, let A be {30, 20, 100, 60, 90, 10, 40, 50, 80, 70} of
ten...