When inserting an element at the second position of an array, what happens to the original second element?

Consider an array arr of size 5, initially filled with elements [2, 4, 6, 8, 10]. You want to insert the element 5 at position 2 in the array. What would be the array after the insertion?

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]?

What method is used to add an element to the end of an array in JavaScript?(2 Points)push()add()append()insert()

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

Which element is moved during the insertion of a new element into a Max Heap?