In Python please, there should be six distinct permutations of the letters ijk.

Objective of this assignment is to examine performance differences and possible reasons in the six implementations of the algorithms to compute the update C =C+AB where A, B, and C are matrices. 1) Produce a performance table in the format below. Entries in the table should be execution time for each computation. You should only measure the execution time for the update and not other instructions. Compute the times for at least ten different matrix sizes. In each case generate large random matrices of different sizes (this time should not be included in the performance table) and compute the update. Matrix size ijk jik jkj jki kij kji 2) Explain any observable differences and potential reasons