[8 marks] Consider the following array of values. [O] [1] [2] [3] [4] [5] [6] 1045 -80 66 - 90 33 a. Show how to sort these numbers in ascending order (smallest to largest) using Insertion sort. Show how the list looks after the algorithm makes first and then second pass (iteration) over the data. b. Show how to sort these numbers in descending order (largest to smallest) using Bubble sort. Show how the list looks after the algorithm makes first and then second pass iteration) over the data. Fix the largest item first