Question:
The solution of (a) let the $\lambda = 0$, l do not understand why. Isn't that $\lambda$ can only have the value which is the same as each eigenvalue of the matrix? why $\lambda$ can be substituted with $0$ ? Does $\lambda$ still have the meaning of eigenvalue?

For any square matrix $A$, we define $$f(x)=|xI-A|$$ also according to definition of eigenvalue$$Av=\lambda v\to (A-\lambda I)v=0$$this means that there is a linear dependence between the rows of $A-\lambda I$ (with the coefficients being the entries of $v$) therefore $|A-\lambda I|=0$. Conversely, if for some $\lambda$ we have $|A-\lambda I|=0$ then there exists some linear dependence as described before for which$$(A-\lambda I)v=0$$and $\lambda$ and $v$ become eigenvalue and eigenvector respectively. Therefore the equation $|A-\lambda I|=0$ yields to all eigenvalues. Equivalently (and fortunately!) all the roots of $f(\lambda)=0$ are the eigenvalues. This means that we can express $f(\lambda)$ as following$$f(\lambda)=|\lambda I-A|=(\lambda-\lambda_1)(\lambda-\lambda_2)\cdots (\lambda-\lambda_n)$$by substituting $0$ we obtain $$|-A|=(-1)^n |A|=(-1)^n \lambda_1\lambda_2\cdots \lambda_n$$which leads to $$|A|= \lambda_1\lambda_2\cdots \lambda_n$$