Consider the following array $A$ of integers:

$\backslash$table$[[11,7,4,13,19,9,23,2,15,12,17,6]]$

Illustrate the operation of the following sorting algorithms on $A,$ showing the contents of the array after completing each outermost iteration. Include the number of element comparisons and element assignments for each such iteration.

b$)$ INSERTION SORT

$\backslash$table$[[,,,,,,,,,,,,\backslash$table$[[$#