The attached template deals a deck of $52$ cards in random order into an array named udeck$[52]($for unsorted deck$).$ The cards are each stored in a structure which has been typedef'ed and given the type name "card". Use the Rank Sort algorithm discussed this week to sort the cards in order. The cards are in four suits, Clubs $(\text{'}$C$\text{'}),$ Diamonds $(\text{'}$D$\text{'}),$ Hearts $(\text{'}$H$\text{'}),$ Spades $(\text{'}$S$\text{'}),$ and the suits are ordered $\text{'}$C$\text{'}<\text{'}$D$\text{'}<\text{'}$H$\text{'}<\text{'}$S$\text{'}($i$.$e$.$ all Clubs are less than all Diamonds, and so forth$).$ The card ranks are $\text{'}2\text{'}$ through $\text{'}9\text{'},$ ten $(\text{'}$T$\text{'}),$ Jack $(\text{'}$J$\text{'}),$ Queen $(\text{'}$Q$\text{'}),$ King $(\text{'}$K$\text{'}),$ and Ace $(\text{'}$A$\text{'}),$ and are ordered from low $\text{'}2\text{'}$ to high $\text{'}$A$\text{'},$ respectively. As examples, $\text{'}$AC$\text{'}<\text{'}2$D$\text{'},$ and $\text{'}$TS$\text{'}<\text{'}$JS$\text{'}.$ Update the template to sort the cards in order with the Parallel Rank Sort algorithm using $52$ processors. Assigned the ordered cards to the sorted deck sdeck$[52].$ Display the sorted deck using the same function that displays the unsorted deck. Post your solution to this assignment as "assign$2.$c$".$ 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

SEQUENTIAL EXECUTION TIME: $747943$

PARALLEL EXECUTION TIME: $25681$

SPEEDUP: $29\mathrm{.}12$

NUMBER OF PROCESSORS USED: $53/*$ Assignment $2*/$

$/*$ Name: $\_\_\_\_\_\_*/$

#define DECK $52$

#define SUIT$\_$SZ $4$

#define RANK$\_$SZ $13$

#define APRIME $47$

typedef struct

$\{$

char suit;

char rank;

$\}$ card;

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

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{'}\}$;

card udeck$[$DECK$],$ sdeck$[$DECK$]$;

int compare$\_$cards$($card a$,$ card b$)$

$\{$

return $0$;

$\}$

void putinPlace$($int src$)$

$\{$

card testval;

testval $=$ udeck$[$src$]$;

$\}$

void deal$()$

$\{$

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

m $=$ APRIME;

v $=$ m;

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

$\{$

r $=$ v $\%$ DECK;

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

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

v $+=$ m;

$\}$

$\}$

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

$\{$

int i;

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

$\{$

cout $<<""<<$ dk$[$i$].$rank $<<$ dk$[$i$].$suit;

if $($i $\%$ RANK$\_$SZ $==($RANK$\_$SZ $-1))$

cout $<<$ endl;

$\}$

$\}$

int main$()$

$\{$

int i;

cout $<<$ endl;

deal$()$;

display$($udeck$)$;

$/*$

Parallel Rank Sort

$*/$

return $0$;

$\}$