P5. Let A [9, 5, 1, 3, 2, 7]. After 3 complete passes of insertion sort (3 iterations of the outer loop) the partially sorted array A is now: [1, 2, 3, 9, 5, 7] Is the above statement true or false? Justify your answer // Insertion sort pseudo-code provided for reference. for 1; j-0) and (A[il>key) A[i+1] key P6. a) Write code or pseudo-code for insertion sort. b) Given the array below, show how it is being processed by insertion sort (as described by you above). In particular, on each row, fill in the values of the array at the end of the outer loop of insertion sort. 4 9 1 611 07 After the first execution of the outer loop. After the second execution of the outer loop. After the third execution of the outer loop ...(and so on)... c) Show the array after each iteration of the inner loop