qn 41

pleasehelp urgently

Question 41 (10 points) Suppose you use insertion sort algorithm presented in the chapter 3 of the textbook to sort these values in an array, 60,20,15,40,5,45,50 Show the array content after each swap during the sorting process. NOTE: No coding is required. Just list the array content