Rank Sort Write an efficient parallel program that reads n integers from any input file and implements rank sort using p processors (p

Rank Sort
Write an efficient parallel program that reads n integers from any input file and implements rank sort using p processors (p < n).="" assume="" n="" is="" divisible="" by="">
Given n integers stored in an array, rank sort computes rank of every a[j] as follows:

Rank a[j] = no. of array elements that are ≤ a[j] for k = 0, 1, 2 … j-1

      + no. of array elements that are < a[j]="" for="" k="j+1," j+2,="" j+3,…="" n="" –="">

Note: Every a[j] is compared with all array elements.