A$)$ An array of $10$ elements, a $[0$:$9].$ having values $[4,2,6,7.1.0.9.8,5,3]$ is to be sorted using insertion sort. Draw a figure to show the progress of the sorting, for the above sequence of input values.B$)$ Determine the functionality of the following code segment and estimate the running time:$3+2$ markssmall $=$ i:for i $=$ i$+1$: j &It: n; j$++)$if $($A$[$i$]$ A$[$small$])$small $=$ j: