Help please!! I need help to implement in C++ algorithm that calculates the matrix multiplication of two matricies that is faster than naive algorithm located below, which uses the cache optimizations. Also please explain the optimizations.

Problem 2 In C++, implement an algorithm, that calculates the matrix multiplication of two ma- tricies that is faster than the naive algorithm using cache optimizations. Benchmark your algorithm's implementation against the naive and explain your optimizations. You can use this naive implementation or create your own. void matmul( volatile double a, volatile double eb, volatile double *c, uint64_t m, uint64_t n, uint64_t p) for (uint64_t i = 0; i