Write the state/order of the elements of the following array after each pass of the outermost loop of the Insertion sort algorithm [ 8, 5, -9, 14, 0, -1, -7, 3 ] for example,  1st pass: 8, 5, -9, 14, 0, -1, -7, 3 2nd pass:  3rd pass:  4th pass:

operation of insertion-sort on the array A= {31,41,59,26,41,58}

Subject - Design and Algorithms Use Radix Sort algorithm to sort the array A = [765, 984, 109, 349, 653, 139, 810, 451, 690, 371].(Note: You must perform the Radix Sort algorithm step-by-step and show your clearly please)

Select all the statements that are false, bubble sort is defined below:*             Quicksort is the fastest sorting algorithm         If you are lucky, you can get O(n) time complexity in Mergesort         On the worst case, Bubble sort will give you O(n logn) time complexity         Average time complexity of insertion sort is much better than bubble sort         Selection sort has the worst space complexity among all the sorting algorithm