Consider running Bubble and Selection Sorts on the two arrays shown below. Write a c program to compute the number of swaps performed on each value and the total number of swaps performed in the following $2$ arrays:

array$1$: $97164563132275872$

array$2$: $908070605040302010$

Provide your git repository URL.

The output should have a similar output:

array$1$:

$7$: # of times $7$ is swapped

$13$: # of times $13$ is swapped

$.$

$.$

total # of swaps

array$2$:

$10$: # of times $10$ is swapped

$20$: # of times $20$ is swapped

$.$

$.$

total # of swaps

Please pay attention that the total # swaps is not equal to the sum of the

swaps of each value listed above.

Output should be:

array$1$ bubble sort:

$7$: $6$

$13$: $5$

$16$: $3$

$22$: $4$

$45$: $4$

$58$: $2$

$63$: $5$

$72$: $1$

$97$: $8$

$19$

array$2$ bubble sort:

$10$: $8$

$20$: $8$

$30$: $8$

$40$: $8$

$50$: $8$

$60$: $8$

$70$: $8$

$80$: $8$

$90$: $8$

$36$

array$1$ selection sort:

$7$: $1$

$13$: $1$

$16$: $2$

$22$: $1$

$45$: $1$

$58$: $1$

$63$: $3$

$72$: $1$

$97$: $3$

$7$

array$2$ selection sort:

$10$: $1$

$20$: $1$

$30$: $1$

$40$: $1$

$50$: $0$

$60$: $1$

$70$: $1$

$80$: $1$

$90$: $1$

$4$