Question 7 1 pts What are the correct intermediate steps of the following data set when it is being sorted with the Insertion sort? 17,22,12,20 0 17,22,12,20 --12,17,22,20 -- 12,17,20,22 0 17,22,12,20 --12,20,17,20 -- 12,17,20,22 0 17,12,22,20 --17,12,20,22 -- 12,17,20,22 12,22,17,20 --12,17,22,20 -- 12,17,20,22 Question 6 1 pts Select all statements that are true about the time and space complexity of Insertion Sort: The time complexity of the best case is 0 (n) The time complexity of the best case is 0 (1) The worst case time complexity of Insertion sort is 0 (n^2), i.e., order n squared The space complexity is 0 (1)