Write a program that uses a recursive algorithm to calculate the determinant of a matrix. The program should read a matrix and calculate and print the determinant. Your matrix implementation should be that of a "sparse" matrix. Only matrix elements that are non-zero should be allocated in memory. This means you cannot implement your matrix with a 2D array.

Recall that the formula for the determinant of a matrix is

det=i=0numRows1((1)i+ja[i,j]det(Minor(a[i,j])))foranyjdet=i=0numRows1((1)i+ja[i,j]det(Minor(a[i,j])))foranyj

The minor of a matrix element x is the sub-matrix formed by removing the row and column containing x.

a= 0 4 1 3

1 3 2 4

2 3 1 9

1 8 2 1

and minor a(1, 2) removes row 1 and column 2

minor(a(1,2)) = 0 4 3

2 3 9

1 8 1

C++ please i need help, this needs to be done with linked lists, I could do it with an array but with linked lists its a lot harder I'm not sure where to begin, also could you PLEASE PLEASE PLEASE describe the matrix implementation?

det 'urnRous- ( (-1)'+, . a [i, j) . det (Minor (a [i, j))) for any j det 'urnRous- ( (-1)'+, . a [i, j) . det (Minor (a [i, j))) for any j