<P> Example: The following table shows the steps for sorting the sequence (3, 7, 4, 9, 5, 2, 6, 1). In each step, the key under consideration is underlined . The key that was moved (or left in place because it was biggest yet considered) in the previous step is shown in bold . </P> <P> 3 7 4 9 5 2 6 1 </P> <P> 3 7 4 9 5 2 6 1 </P> <P> 3 7 4 9 5 2 6 1 </P>

What is the performance of the average case for insertion sort