Please write down the solution process and answers for each question separately.

This project computes the two largest eigenvalues of a 50x50 matrix. You will use the usual Power Method to compute the largest eigenvalue. For the next largest eigenvalue, you can use \"Weilandt's Deflation. The algorithm is in our book. A full computer program can be found on our book's website. The matrix A is tridiagonal. Its main diagonal has \"1\" on it. The super diagonal (the diagonal above the main diagonal) has \"8\" on it. The sub-diagonal (below the main diagonal) has \"2\". Rest of the matrix is \"zero\". Our starting vector Xo has all ones. Our tolerance is 0.01. Turn in the following on one page 1) Draw Gershgorin Circles that contain the eigenvalues of A. Mark each radius properly. 2) Based on part (1), what is the spectral radius of A. 3) With a starting vector x,=[1 1 1 1....1]7, apply the usual power method to estimate Amax , the dominant-eigenvalue of matrix A. Use a tolerance of 0.01. Print your answer with 4 decimals: 4) Print the number of iterations required to converge. 5) Use the deflation technique discussed in class or in the book, to compute the second largest eigenvalue. Tolerance = 0.01. Print the second largest eigenvalue with 4 decimals: 6) Print the number of iterations required for the second largest eigenvalue to converge. 7) Print your computer programs here, Power Method and Weilandt's Method