Need help on this one, please help. Will rate. Thanks!

8. (a) Find the number of flops for the following backward substitution bn ann For k-n -1,... ,1 akk j-k+1 end (b) Let A and T be two non-singular, n n real matrices. Furthermore, assume T A = L , where L is unit lower triangular, and is upper triangular matrix. Design an algorithm that will solve the problem A-b for any given b in O(n2) complexity. Justify the complexity. No pseudo-code or Matlab script s necessary 8. (a) Find the number of flops for the following backward substitution bn ann For k-n -1,... ,1 akk j-k+1 end (b) Let A and T be two non-singular, n n real matrices. Furthermore, assume T A = L , where L is unit lower triangular, and is upper triangular matrix. Design an algorithm that will solve the problem A-b for any given b in O(n2) complexity. Justify the complexity. No pseudo-code or Matlab script s necessary