An matrix is called upper triangular if whenever .How many multiplications of entries are used by the algorithm found in Exercise 41 for multiplying two n x n upper triangular matrices?Exercise 41: From the definition of the matrix product, describe an algorithm in English for computing the product of two upper triangular matrices that ignores those products in the computation that are automatically equal to zero

SolutionStep 1In this problem we have to find the number of multiplication required to multiply two n x n upper triangular matrices.Step 2Upper triangular matrices.In an upper triangular matrices, all the matrices below the diagonal is zero and all the 1’s on the diagonal.Algorithm for product of two upper triangular matricesLet us consider that matrices A be a order of , matrices B be a order of and matrices C be a order of Now start the first loop for(i = 1 ; i < = N ; i++ ) where N be a multiplication of Now, start the second loop for(j = 1 ; j <= ; i++)Now, start the last loop...