2. [15 pts] Suppose we are given a set of n positive integers stored in an array A, with the sum of those integers being d. Assume that B[1..d). For each i, 1 sisn, we want to write i into i consecutive positions of B, such that the positions of B containing i follow the positions containing i-1, for each i. Here is an example: A= 4 1 2 0 3 Then: B- 1 2 3 3 st s Develop an O(log n) time, O(n + d) work EREW algorithm to produce B, given A