In insertion sort, if an element is smaller than the previous element, what action does the algorithm take?a.Ignores the elementb.Moves the element to the end of the arrayc.Swaps the element with the previous oned.Leaves the element as it is

Suppose the array a contains 2 8 11 14 and currentSize is 4. What would happen if one moved the elements starting at the insertion position instead of starting at the end of the array? Explore with the following code walkthrough.12345678int pos = 1;int newElement = 6;currentSize++;for (int i = pos + 1; i < currentSize; i++){ a[i] = a[i - 1];}a[pos] = newElement;Track variables in a trace table. On a sheet of paper, make the table below (the first row is filled in with initial values):currentSize i a[0] a[1] a[2] a[3] a[4]4 2 8 11 14 Add a row to the table after every iteration of the for loop.1)Lines 1, 2, and 3 execute. What is the new value of currentSize?CheckShow answer2)Next, line 4 executes. What is the value of i?CheckShow answer3)Line 6 executes. What is the value of a[2]?CheckShow answer4)The execution flow returns to line 4. What is the new value of i?CheckShow answer5)Next, line 6 executes. What is the value of a[3]?CheckShow answer6)The execution flow returns to line 4. What is the new value of i?CheckShow answer7)Next, line 6 executes. What is the value of a[4]?CheckShow answer8)The execution flow returns to line 4. The next line executed after line 4 is line _____.CheckShow answer9)What is the value of a[1]?

In which  sort algorithm divides the list into two parts, sorted and unsorted. Initially, the sorted part contains only one element. In each pass, one element from the unsorted list is inserted at its correct position in the sorted list. As a result, the sorted list grows by one element and the unsorted list shrinks by one element in each pass.Insertion SortSelection SortMerge SortBubble Sort

Which algorithm builds a sorted array one element at a time by inserting each elementinto its correct position within the sorted region?*1 pointYour answer

Which of the following algorithm pays the least attention to the ordering of the elements in the input list?Insertion sort Selection sort Quick sort None

Which sorting algorithm compares adjacent elements and swaps them if they are in the wrong order?Options: Pick one correct answer from belowBubble SortSelection SortInsertion SortMerge Sort