This project will ask student to conduct the matrix multiplication on the numeric data type. You can

implement the above three algorithms in your choice of data structures based on the program language of

your choice. Note that you always try your best to give the most efficient program for each problem. Let

the matrix size be n x n$.$ Carry out a complete test of your algorithms with n $=2,4,8,16,32,64,128,$

$256,...($up to the largest size of n that your computer can handle$).$ The size of the input will be limited in

the power of $2.$ They are $2,4,8,16,32$ up to $2$k where $2$k is the largest size of the input that your computer

can handle or your program might quit at size of $2$k due to running out of memory. The reason for the

power of $2$ is to ease the programming component of the assignment