Please implement using c. code I completed for first part is attached.

In this exercise you will implement a matrix triangulation function that will transform a two-dimensional array of coefficients for a system of equations into upper triangular form Consider the following three equations in three unknows, x, y, and z: x+y-2z = 2 -x-2y+5z-1 The coefficients of these three equations can be represented as a matrix A, 1 3 -4 In C, matrix A can be initialized as follows #define ROWS 3 #define COLS 3 double a [ROWS+1] [cOLS+1] -(o, 0, 0,o), (0,1,3,-4), 0, 1,1,-21, o,-1,-2,5))i Notice in this initialization method we "waste" an extra row and column. This practice will allow us to index elements of the array as [1...3][1...3] instead of [0...2][0...2], which is more intuitive The idea is to eliminate the first coefficient in all rows except the first row by adding a multiple of the first row to each of the other two rows. Then, eliminate the second coefficient in all rows except the first two by adding a multiple of the second row to the third row To eliminate the h coefficient in the row for i+1s js N, multiply the h row by a [jl [i)/a[i) [iland subtract it from the f equation. For example for (1-1; i