in C++

In this project you'll perform a comparison of time-efficiencies of generic matrix multiplication algorithms. for each of of the following types of matrices: 1. Regular matrix 2. Upper triangular matrix 3. Lower triangular matrix 4. Diagonal matrix 5. Tri-diagonal matrix Part 1 Explore and implement the matrix multiplication for each matrix type (use straight-forward algorithms only). For each type of matrix, identify the basic operation(s) and then compute C(n), the number of times the basic operation(s) is executed (n is the number of elements in the matrix). Then display the values of C(n) in a Table with the row values indicating the size n. starting from 10^2 and ending at 10^8 (for even numbered exponents). Part 2 Based on the values of C(n) computed in Part 1, identify O(C(n)) that is the closest estimate to the running time of the algorithm. Submit your answer in a document