in cl Sort. NAME: Student Number: CSE4/529 MidTerm II Fall, 2013 This exam is closed bookoteseighbors/etc. Answer all questions on these exam pages. No code or pseudo-code is necessary - just a precise and concise explanation and justification. Give the best answer possible. Unsupported work will receive no credit. Q1 of 3 (10 pts) Given a set of n integers with values in the range of [1,100], arbitrarily distributed, give an efficient algorithm to "sort" these values. Your algorithm should be based almost exclusively on use of the parallel prefix operation. Discuss the asymptotic running time and cost of your solution on each of the following architectures. a) b) c) RAM CREW PRAM with n processors Tree of base sizen in cl Sort. NAME: Student Number: CSE4/529 MidTerm II Fall, 2013 This exam is closed bookoteseighbors/etc. Answer all questions on these exam pages. No code or pseudo-code is necessary - just a precise and concise explanation and justification. Give the best answer possible. Unsupported work will receive no credit. Q1 of 3 (10 pts) Given a set of n integers with values in the range of [1,100], arbitrarily distributed, give an efficient algorithm to "sort" these values. Your algorithm should be based almost exclusively on use of the parallel prefix operation. Discuss the asymptotic running time and cost of your solution on each of the following architectures. a) b) c) RAM CREW PRAM with n processors Tree of base sizen