Draw Flowchart for Start: Begin the insertion sort algorithm.

Initialize i $=1$: Set the initial index i to $1.$

Outer Loop Condition: Check if i is less than the length of the array.

If Yes, go to step $4.$If No$,$ proceed to End $($the array is sorted$).$

Set Key and Initialize j:

Set key $=$ X$[$i$].$Set j $=$ i $-1.$

Inner While Loop Condition: Check if j is greater than or equal to $0$ and X$[$j$]$ is greater than key.

If Yes, go to step $6.$If No$,$ proceed to step $8.$

Shift Element Right:

Move X$[$j$]$ to X$[$j $+1].$Decrement j by $1.$

Repeat Inner Loop: Return to step $5.$

Insert Key:

Place key in X$[$j $+1].$

Increment i: Increase i by $1.$

Repeat Outer Loop: Return to step $3.$

End: The array is sorted.