Problem 5. Let A be an array of n integers, each of which comes from the domain [1, U]. Note that some of the integers may be identical. Design an algorithm to compute, for each distinct integer x in...

Extracted text: Problem 5. Let A be an array of n integers, each of which comes from the domain [1, U]. Note that some of the integers may be identical. Design an algorithm to compute, for each distinct integer x in A, how many integers in A are at most x. For example, if A stores the sequence of integers (35, 12, 28, 12, 35, 7, 63, 35), you should output an array ((7, 1), (12, 3), (28, 4), (35, 7), (63, 8)). Your algorithm should terminate in O(n log n) time.