Please answer question c

2. (a) (2 points) Let A be an n n nonsingular lower triangular matrix with all of its nonzero entries on three diagonals of the matrix: the main diagonal, the first sub- diagonal and the second sub-diagonal; that is, 01,1 2,1 a2,2 , 1 a3,2 a3,3 a4,2 a4,3 14,4 an-1,n-3 an-1,n-2 In-1,n-1 Cl n,n-2 n,n-1 n,n Note that A is nonsingular if and only if all of the entries on its main diagonal are nonzero, that each row of A contains at most 3 nonzero entries, and that entries on the first sub-diagonal and the second sub-diagonal may be nonzero or zero. For example, if n -6, then 3 0 0 000 2 1.1 2.3 0 10 0 2.2 3 -2.11 00 0 0 0 23.3 0 0 0 0 2.4 1 -2.5 is such a lower triangular matrix. Let b [b1, b2, b] denote a (column) vector with n entries. An n x n system of linear equations Ax , where A is as described above, can be efficiently solved by forward substitution, which is similar to back-substitution but starts with the first equation. That is, the first equation can be used to solve for x1, the second equation can be used to solve for x2, the third equation for x3, and so on