Please solve the question of Data Structure and Algorithm by using C programming.a$.$ Implement a matrix multiplication algorithm.

b$.$ Generate random matrices $A(nn)$ and $B(nn),$ where $n$ is a user$-$defined

parameter. Measure the execution time of your matrix multiplication

algorithm for different matrix sizes $($vary $n)$ to analyze its performance.

c$.$ Repeat the measurements multiple times to ensure consistency. Present your

findings in a report, including the average execution time for each matrix size.

d$.$ Repeat the whole process, with $1.$ a row$-$row matrix multiplication algorithm

$($by taking transpose of the second matrix first$),$ and $2.$ a $1$D implementation of

nxn matrices.

Analysis:

For each question, you need to submit a plot with the following axes: X$-$axis: Matrix

Size $($n$),$ Y$-$axis: Execution Time $($in seconds$).$ Plot different lines representing the

execution time for the $3$ multiplication algorithms.

This will help visualize how the algorithm's performance scales with the input size.

Instructions:

Choose appropriate values for matrix dimension $n,$ equally spaced, with non$-$zero

execution times, to demonstrate a range of input sizes. Fill the matrix with random $\text{'}8$

bit' integers. $(0-255)$

Only consider the execution times for multiplication function, and not for

initialization, and data preprocessing $($e$.$g$.$ transpose$).$