need the code in cstar for parllel computing theory

Modify your assignment $2$ solution to use FORK instead of FORALL to implement the

parallel rank sort. You may use the posted solution to Assign$2$ if necessary. If it has

not been posted because of late assignments still to be submitted, ask the TA for a

copy. Assume that only seven $(7)$ processors $($in addition to the main processor$)$ are

available and design the solution to run on $7($plus the main$)$ processors. Set the

number of processors as a #define value so you can change the number of

processors. Also test your code with $5$ processors, but submit the $7$ processor

solution. Count the number of JOIN's that are executed and write them out after the

sorted display. For $7$ processors, the output should look something like this.

TS $5S,KH,8H,3H,$ JD $6D,AC,C_{4C}$ QS $7S,2S$

TH $5$H KD $8$D $3$D JC $6$C AS $9$S $4$S QH $7$H $2$H

TD $5$D KC $8$C $3$C JS $6$S AH $9$H $4$H QD $7$D $2$D

TC $5$C KS $8S3S$ JH $6$H AD $9$D $4$D QC $7$C $2$C

$2$C $3$C $44$C $55$C $66$C $77$C $8C,9C$ TC JC QC KC AC

$2$D $3$D $4$D $5$D $6$D $7$D $8$D $9$D TD JD QD KD AD

$2H3H4H,5H6H7H8H9H$ TH $JH$ QH KH AH

$2S,3S,4S,5S,6S,7S,8S,9S$ TS JS QS KS ASModify your assignment $2$ solution to use FORK inst