If you could explain the code as well that would be great! I will rate all answers! Course is linear algebra and I have included theorem 3.2.21

Write a computer program to compute the QR factorization of a 5x5 matrix, either by 1. using rotators. Use the algorithm described in the proof of Theorem 3.2.21; or 3. using reflectors, but don't cut and paste a program from the web. Instead write a possibly less efficient program that you understand. Test your algorithm by the following code A = rand(5); do the QR factorization of A... Q*Q, % This should print out the 5x5 identity matrix R % visually verify that it is upper triangular A-Q"R % This should print out the 5x5 zero matrix Some of the entries that should be zero will only be close to zero (e.g. 1e-15). Don't worry about that. Write a computer program to compute the QR factorization of a 5x5 matrix, either by 1. using rotators. Use the algorithm described in the proof of Theorem 3.2.21; or 3. using reflectors, but don't cut and paste a program from the web. Instead write a possibly less efficient program that you understand. Test your algorithm by the following code A = rand(5); do the QR factorization of A... Q*Q, % This should print out the 5x5 identity matrix R % visually verify that it is upper triangular A-Q"R % This should print out the 5x5 zero matrix Some of the entries that should be zero will only be close to zero (e.g. 1e-15). Don't worry about that