An array a[ ] of n elements is being sorted using the insertion sort algorithm. the algorithm is at the last stage, with the segment of the array in positions 0 through n-2 already sorted. how many array elements will a[n-1] have to be compared to, before it can be placed into its proper position?

i think it’s a. this is because if they measured the mass of something with a mass of 150g, then their final answer would have to be approximately 150g. though all of their answers are almost 150, rosa and tran have the closest answers (or the exact answer) to the accurate one.

he made 11 calls in one day

see earlier answer

c. magnitude and direction