In the lecture slides ofthe SOR method (slide # 21 of the lecture), we aim to solve the following linear system: I. 24 3 -24 (a) In the lecture, we mention that a choice of ?:-1.25 can give us a fast convergence with the SOR method. Can you confirm this result by writing a code on your own. Based on theory given in the class, a better choice of is in fact given by can you confirm the theory by your implementation? How fast is the convergence using a more precise ? number e > 0, say 0.1, what is the convergence again? theoretical support for it? (b) Now if we change both the zero entries in the original matrix to a small (c) (Bonus) For what kind of small we can obtain a good convergence? Any In the lecture slides ofthe SOR method (slide # 21 of the lecture), we aim to solve the following linear system: I. 24 3 -24 (a) In the lecture, we mention that a choice of ?:-1.25 can give us a fast convergence with the SOR method. Can you confirm this result by writing a code on your own. Based on theory given in the class, a better choice of is in fact given by can you confirm the theory by your implementation? How fast is the convergence using a more precise ? number e > 0, say 0.1, what is the convergence again? theoretical support for it? (b) Now if we change both the zero entries in the original matrix to a small (c) (Bonus) For what kind of small we can obtain a good convergence? Any