8 1 Gaussian Elimination - Amount of Computation Lab 05. matrix Inversion Use Gauss-Jordan Method with Partial Pivoting to find the inverse of a given matrix Input There are severalsets of inputs. For each set: The 1st line contains an integer 100>n20 which is the size of a matrix. n=-I signals the end of file The 2nd line contains nxn real numbers 112··“1 which are the entries of the matrix. The numbers are separated by spaces or new lines Output Each entry of the inverse matrix is to be printed as in the c fprintf printf(outfile, %168e",a); *here d represents a space*/§1 Gaussian Elimination – Amount of Computation Lab 05. Matrix Inversion Use Gauss-Jordan Method with Partial Pivoting to find the inverse of a given matrix. Input There are severalsets of inputs. For each set: The 1 st line contains an integer 100  n  0 which is the size of a matrix. n = −1 signalsthe end of file. The 2 nd line containsnn real numbers which are the entries of the matrix. The numbers are separated by spaces or new lines. Output Each entry of the inverse matrix is to be printed as in the C fprintf: fprintf(outfile, "%16.8e", a ); /* here  represents a space*/ a a a n a a n an ann ... ... ... ... 11 12 1 21 2 1