Here is the MATLAB solution below for the question above. I need to change the code below to something else, but I need the solutions to match each other. (Also try not to copy answer posted on chegg already)

clc; clear all; close all; % reset matlab w n = 5*10^3; A = randn(n,n); B = randn(n,10); C = randn(10,n); tic; (A*B)*C; toc A*(B*C); toc

2.5 Give the number of flops required to evaluate a product of three matrices X = ABC, where A is n n, B is n 10, and C is 10 n. You can evaluate the product in two possible ways (a) From left to right, as X = (AB)C. (b) From right to left, as X- A(BC) Which method is faster for large n