Execution of insertion sort requires time that grows as the square of the input size. Suppose that an array of 6,000 elements can be sorted with insertion sort in 6 seconds. From that knowledge, we can estimate that:Group of answer choicesSorting an array of 18,000 elements with insertion sort will take around 54 secondsSorting an array of 12,000 elements with insertion sort will take around 12 secondsSorting an array of 12,000 elements with insertion sort will take around 15 secondsSorting an array of 2,000 elements with insertion sort will take around 1 secondSorting an array of 2,000 elements with insertion sort will take around 2 seconds

Suppose that an array of 5,000 random elements can be sorted with insertion sort in 4 seconds. From that knowledge, we can estimate that:Sorting an array of 2,500 random elements with insertion sort will take around 0.5 secondsSorting an array of 2,500 random elements with insertion sort will take around 2 secondsSorting an array of 10,000 random elements with insertion sort will take around 10 secondsSorting an array of 10,000 random elements with insertion sort will take around 12 secondsSorting an array of 7,000 random elements with insertion sort will take around 8 seconds.

The efficiency of the Insertion Sort is O(N2) where N is the size of the list being sorted.Group of answer choicesTrueFalse

Question2Max. score: 3.00What is the time complexity of insertion sort?

Your project manager is not familiar with sorting algorithms and wants to understand how efficient insertion sort is. Explain the efficiency of insertion sort in terms of time complexity, and also mention situations where it can perform well or poorly.

What is the time complexity of inserting at index n on an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))