Q$1$: Use Compiler $($ex: C$++)$ to create $2($n$*$n$)$ matrices $[$A$]*$

$[$A$]*[$B$]$

$[$B$]=[$C$].$ Generate A and B randomly as follows:

Execution Time

$[100*100]*[100*100]$

$[500*500]*[500*500]$

$[1000*1000]*[1000*1000]$

$[2500*2500]*[2500*2500]$

$[5000*5000]*[5000*5000]$

$[10000*10000]*[10000*10000]$

$[20000*20000]*[20000*20000]$

Q$2$: A$)$ Use Compiler $($in: C$++)$ to create array A$=[.....$n$],$ Generate A randomly as follows, then apply insertion and selection sort for the same generated array:

A$=[1.....$n$]$ Insertion sort time Selection sort time

$100$

$500$

$1000$

$2500$

$5000$

$10000$

$25000$

$50000$

$100000$

B$)$ Apply insertion sort to sort the string $$algorithm$"$ in alphabetical order

Show each iteration of insertion sort on the string. Find the number of comparisons