IB_SL_Unit4 Name: Question 6 2 4 -1 2 -10 -18 -10 5 11 4 5 -7 18 -7 6 -1 11 6 Write an algorithm that outputs the transpose of a square 2D array of size NxN. This is where the array(5 marks) is flipped on the diagonal, so that an element that is at location [x][y] is now at [y][x]. Question 7 Outline the main steps involved in a selection sort algorithm. (3 marks) (4 marks) Question 8 Construct a trace table for the following algorithm. K = 1 N = 1 M = 100 loop while K