Write a program that specializes in solving the equations Ax=b by Doolittle's decomposition method, where a is the HIbber matrix of arbitrary size nxn and
b[i] = the summation of j = 1 ? n when A[ij]
The program should have no input apart from n. By running the program, determine the largest n for which the solution is within 6 significant figures of the exact solutino
x = [ 1 1 1 .....] ^ T