Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why? Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why?Compare the sorting durations of the insertion sort and QuickSort using a tiny array (less than 20). What is the time difference? Could you clarify why?

A given implementation of bubble-sort takes on average 1 second to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take? A given implementation of quicksort takes on average 0.1 seconds to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take?

Answer the given question with a proper explanation and step-by-step solution. java

Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original  array that needs to be sorted. Which one of the following statements on the space usage of  sorting algorithms is correct?  a.)  A Heapsort for sorting an array of size N requires an amount of extra space proportional  to N.   b.)  Insertion Sort for sorting an array of size N requires an amount of extra space  proportional to N.   c.)  Merge sort for sorting an array of size N requires an amount of extra space proportional  to N.   d.) Quicksort for sorting an array of size N requires an amount of extra space proportional  to N.   e.) None of the above