Create a c++ program that implements the matrix multiplication algorithm to multiply two 10X10 matrices with random values.

Using the program output the following for multiplying two 10X10 matrices:

1. Total number of multiplications performed 2. Total number of additions performed 3. Total number of assignments

Part 2 (25 points):

Based on the values computed in Part 1, identify an upper bound O(n) that is the closest estimate to the running time of the algorithm.

Submit your program as attachment and type your answer to Part 2 in the text entry box.