Given the array of elements {7. 0. 1. 2. 5. 4. 9. 8. 3. 6}. sort the elements in ascending order using (a) (10 points) selection sort (b) (10 points) insertion soil (e) (10 points) heap soil (d) (10 points) merge soil (e) (10 points) quick sort (assume that the first element is chosen as the pivot) for each sorting algorithm above. show the intermediate array after each iteration.