Please implement using c

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+3y-4z-8 x+y-2c-2 The coefficients of these three equations can be represented as a matrix A 3-4 A=11 1-2 1 -25 In C, matrix A can be initialized as follows define ROWS define COLS 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 p. 210.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 coefficient in the f row for sis N, multiply the a [31 (41/a(41 (4]and subtract t from the f equation. For example row by for -i+1: -N ) for (k N+1: k i:k-- Develop a code that initializes the array given above and computes the upper triangular form Print the matrix of coefficients before and after a triangulate function is called. Here are prototypes of two functions you will need to implement void triangulate (double a (CoLS 11.const size t. const size t N) void printArray (double a) (COLS+1])