please apply insertions sort element-wise comparisons and show steps,

(7 pts) Let A by an array of 5 integers, whose contents are as follows: 3, 2, 1, 5, 4 We will apply insertion sort to this array. Show all the element-wise comparisons made by the algorithm in the correct order. Here an element-wise comparison means the comparison of one element of the array with another element of the array or the key set in a particular set of the algorithm. Since the algorithm may move elements of the array, you need to show the values of the elements be compared (rather than referencing the index such as A. The first element-wise comparison is: 3>2? You should start with this element-wise comparison to write out all the element-wise comparisons, one compari son per row