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

$\backslash$table$[[A=[1$dots..$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