#include arr$[]=\{1,2,3,4,5{\}}^{**}\frac{?}{?}$

$==0$;$i<mn\; id="EditorElement\_468848">5</mn>$;$i++ptr=$arr;$=0$;$i<mn\; id="EditorElement\_468866">5</mn>$;$i++ptr=$arr$\frac{\text{;}}{?}$

$=ptr=$arr$\frac{\text{;}}{?}$

$=0$;$i<mn\; id="EditorElement\_468901">5</mn>$;$i++$ptr $=$ arr;

printf$("$Value at ptr: $\%$d

$",(*$ptr$)++)$;

printf$("$Updated ptr: $\%$p

$",($void$**)$ptr$)$;

for $($int i $=0$; i $<mtext\; id="EditorElement\_468479"></mtext><mn\; id="EditorElement\_468480">5</mn>$; i$++)$ printf$("\%$d $",$ arr$[$i$])$;

puts$("\text{'})$;

$ptr=$arr;

printf$("$Value at ptr: $\%$d

$",++(*$ptr$))$;

printf$("$Updated ptr: $\%$p

$",($void$**)$ptr$)$;

for $($int i $=0$; i $<mtext\; id="EditorElement\_468296"></mtext><mn\; id="EditorElement\_468297">5</mn>$; i$++)$ printf$("\%$d $",$ arr$[$i$])$;

puts$("\text{'})$;

ptr $=$ arr;

printf$("$Value at ptr: $\%$d

$",++*$ptr$)$;

printf$("$Updated ptr: $\%$p

$",($void$**)$ptr$)$;

for $($int i $=0$; i $<mtext\; id="EditorElement\_467738"></mtext><mn\; id="EditorElement\_467739">5</mn>$; i$++)$ printf$("\%$d $",$ arr$[$i$])$;

puts$("\text{'})$;

return $0$ ;

$\}7\mathrm{.}16($Card Shuffling and Dealing Modification$)$ In the card shuffling and dealing program of

Fig. $7\mathrm{.}24,$ we intentionally used an inefficient shuffling algorithm that introduced the possibility of

indefinite postponement. In this problem, you'll create a high$-$performance shuffling algorithm that

avoids indefinite postponement.$//$ Fig. $7\mathrm{.}24$: fig$07\_24.$c

$//$ Card shuffling and dealing.

#include $=\{0\}$

Modify the program of Fig. $7\mathrm{.}24$ as follows. Begin by initializing the deck array as shown in

Fig. $7\mathrm{.}29.$ Modify the shuffle function to loop row$-$by$-$row and column$-$by$-$column through the

array, touching every element once. Each element should be swapped with a randomly selected ele$-$

ment of the array. Print the resulting array to determine whether the deck is satisfactorily shuffled

$($as in Fig. $7\mathrm{.}30,$ for example$).$ You may want your program to call the shuffle function several

times to ensure a satisfactory shuffle.

Unshuffled deck array

Fig. $7\mathrm{.}29|$ Unshuffled deck array.

Sample shuffled deck array

Fig. $7\mathrm{.}30|$ Sample shuffled deck array.