solve for thumbs up!

Question 3: [10 Marks] Selection sort works by finding the minimum element in the unsorted dataset and swapping it with the element in the first position then looking for the second smallest and swapping it with the element in the second position and so on until the dataset is sorted. Whereas the insertion sort start from the 2nd index and in each iteration it compares the key element with the all elements on its left and swap with the greater element. After each iteration we have i+1 sorted elements, this process goes on until we have sorted array. Do consider the given array and perform the following. 1. Dry run the selection sort and insertion sort on the array. 2. Perform the time and space complexity analysis of their algorithms. 3. Compare their complexities in asymptotic notations. 23 10 16 11 20