An integer matrix is an nm array of integers; for example:

a)Write pseudocode for this modied version of insertion sort (call it MatrixInsertionSort) .I dnt want simple insertion sort.

b)Prove the best- and worst-case complexity of MatrixInsertionSort. Matrix is square matrix

c) If comparing two rows take constant time O(1) . Is the worst-case complexity of MatrixInsertionSort in this case better or worse than regular insertion sort? Why?

3 10 1 1012-18 A=13-12-101 670 -23 3 10 5 A row is a series of numbers from left to right and a column is the series from top to bottom. Here, we will modify insertion sort to sort the rows of a matrix, with respect to their colums. For the above example, this yields: [1 1012 -18 3 -12-101 A=13 10 3 105 67 0 -23