[IN PYTHON] Programming problems: Be sure to provide comments making clear any analysis informing the applicationof any method used. Be sure also to comment as needed for readability, and to make all output intelligible.Where applicable, use a tolerance cut-off for change in root approximation no greater than= 105,and provide units for output when appropriate. Do note that methods will be graded for robustness of implementation.

Programming problems: Be sure to provide comments making clear any analysis informing the application of any method used. Be sure also to comment as needed for readability, and to make all output intelligible. Where applicable, use a tolerance cut-off for change in root approximation no greater than = 10-5, and provide units for output when appropriate. Do note that methods will be graded for robustness of implementation. 3. Problem Set 2.2, Problem 8. Use Gaussian elimination. 1. Find the inverse of the matrix 9 1 31 -2 -34 3 11 7 Justify your choice of method. 8. Use Doolittle's decomposition method to solve Ax =b, where A= -3 6 -4 9 -8 24 -12 24 - 26 b= -3 65 -42 Programming problems: Be sure to provide comments making clear any analysis informing the application of any method used. Be sure also to comment as needed for readability, and to make all output intelligible. Where applicable, use a tolerance cut-off for change in root approximation no greater than = 10-5, and provide units for output when appropriate. Do note that methods will be graded for robustness of implementation. 3. Problem Set 2.2, Problem 8. Use Gaussian elimination. 1. Find the inverse of the matrix 9 1 31 -2 -34 3 11 7 Justify your choice of method. 8. Use Doolittle's decomposition method to solve Ax =b, where A= -3 6 -4 9 -8 24 -12 24 - 26 b= -3 65 -42