This must be done in c++.

You are to implement the Gaussian Elimination Algorithm to solve matrix problems provided in a data.txt file The format of the file should be as follows n A[n][n] b[n] that is for file 2 12 34 10 20 would represent A*x = b |1 2 3 4|* [x0 x1] = [10 20] Your solver should be designed to solve diagonally dominant matrices, so rotations are not required. You must use a dynamic matrix object. Your algorithm should take the provided matrix, reduce it to upper row echelon form, then compute the solution with a back-solver Then compute the magnitude of the residual of your solution. ||b - a*x||