The Cholesky algorithm given on page 116 has all those wretched loops as in the Gaussian elimination algorithm in its simplest form. In view of Section 5.4 and the program ainvb we should be able to achieve also the Cholesky decomposition effect more efficiently. Write a code implementing the Cholesky decomposition with only one loop (on k), utilizing outer products.