What is wrong with this code to perform LU decomposition in matlab? function [L,U] = LUDecomp(A) dim = size(A);n = dim(1);m = dim(2); if n~=merror('Matrix A is not a square')end L = eye(n);U = A; for i = 1:nfor j = 1:malpha = U(i,i);U(i,:) = -alpha*U(j,:);L(i,j) = alpha*L(i,j);endend

Write a MATLAB function should take as parameters an unsorted list of non-negative integers, and an integer value, and returns the index where that value is first located in the list. (No argument testing is required.) Your MATLAB function should return the value -1 if the value is not found.

Modify the Chebyshev center coding with julia in a simple style using vectors, matrices and for loops # Given matrix A and vector bA = [2 -1 2; -1 2 4; 1 2 -2; -1 0 0; 0 -1 0; 0 0 -1]b = [2; 16; 8; 0; 0; 0] A small sample:Let t_(l),t_(o),t_(m),t_(n),t_(t),t_(s) be starttimes of the associated tasks.Now use the graph to write thedependency constraints:Tasks o,m, and n can't start until task I is finished, and task Itakes 3 days to finish. So the constraints are:t_(l)+3<=t_(o),t_(l)+3<=t_(m),t_(l)+3<=t_(n)Task t can't start until tasks m and n are finished. Therefore:t_(m)+1<=t_(t),t_(n)+2<=t_(t),Task s can't start until tasks o and t are finished. Therefore:t_(o)+3<=t_(s),t_(t)+3<=t_(s)

Can you help me with the code in MATLAB?