Modify below 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 $5$S KH $8$H $3$H JD $6$D AC $9$C $4$C QS $7$S $2$S

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 $8$S $3$S JH $6$H AD $9$D $4$D QC $7$C $2$C

$2$C $3$C $4$C $5$C $6$C $7$C $8$C $9$C 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

$2$H $3$H $4$H $5$H $6$H $7$H $8$H $9$H TH JH QH KH AH

$2$S $3$S $4$S $5$S $6$S $7$S $8$S $9$S TS JS QS KS AS

$52$ joins executed

SEQUENTIAL EXECUTION TIME: $743363$

PARALLEL EXECUTION TIME: $118080$

SPEEDUP: $6\mathrm{.}30$

NUMBER OF PROCESSORS USED: $8$

$/*$ Assignment $2*/$

$/*$ Name: sunkara dineshgopi$*/$

#define DECK $52$

#define SUIT$\_$SZ $4$

#define RANK$\_$SZ $13$

typedef struct

$\{$

char suit;

int suitr;

char rank;

int rankr;

$\}$ card;

char suits$[$SUIT$\_$SZ$]=\{\text{'}$C$\text{'},\text{'}$D$\text{'},\text{'}$H$\text{'},\text{'}$S$\text{'}\}$;

int suitr$[$SUIT$\_$SZ$]=\{1,2,3,4\}$;

char ranks$[$RANK$\_$SZ$]=\{\text{'}2\text{'},\text{'}3\text{'},\text{'}4\text{'},\text{'}5\text{'},\text{'}6\text{'},\text{'}7\text{'},\text{'}8\text{'},\text{'}9\text{'},\text{'}$T$\text{'},\text{'}$J$\text{'},\text{'}$Q$\text{'},\text{'}$K$\text{'},\text{'}$A$\text{'}\}$;

int rankr$[$RANK$\_$SZ$]=\{1,2,3,4,5,6,7,8,9,10,11,12,13\}$;

card unsorteddeck$[$DECK$],$ sorteddeck$[$DECK$]$;

boolean compare$\_$cards$($card cardA, card cardB$)$

$\{$

if $($cardA$.$suit $!=$ cardB.suit$)$

return cardB.suitr $-$ cardA.suitr $<0$;

return cardB.rankr $-$ cardA.rankr $<0$;

$\}$

void deal$()$

$\{$

int i$,$ m$,$ v$,$ r;

m $=47$;

v $=$ m;

for $($i $=0$; i $<$ DECK; i$++)$

$\{$

r $=$ v $\%$ DECK;

unsorteddeck$[$i$].$suit $=$ suits$[$r $/$ RANK$\_$SZ$]$;

unsorteddeck$[$i$].$suitr $=$ suitr$[$r $/$ RANK$\_$SZ$]$;

unsorteddeck$[$i$].$rank $=$ ranks$[$r $\%$ RANK$\_$SZ$]$;

unsorteddeck$[$i$].$rankr $=$ rankr$[$r $\%$ RANK$\_$SZ$]$;

v $+=$ m;

$\}$

$\}$

void display$($card dk$[])$

$\{$

int i;

for $($i $=0$; i $<$ DECK; i$++)$

$\{$

cout$<<$ dk$[$i$].$rank$<$