1. (20 points) Given an array A [9,3,7, 12, 0, 2], use insertion sort algorithm to sort A in an increasing order. The algorithm scans A froin left to right by size(A) = 6 steps, so please list the changes of A during these 6 steps 2. (25 points) Array A [a1, a2,... , an] is unsorted, design an O(n log n)-time algorithm to report the number of inversions in A. An inversion is a pair of numbers ai and aj such that i