Please help me with this question by using matlab to run it as a different coding method than what I post it. Thank you so much

1. [25 Points] Develop number. Recall that a prime number is an integer larger than 1 and which is divisible only by itself and by 1. an algorithm for adding all prime numbers between 0 and a given % input the number n = input (' Enter a number:') % Sieve of Eratosthenes % Take the first N elements of X x=1:n; % Determine if a number is prime a=isprime (x); % Find all non-zero elements in matrix k and return it to kl al=find (a); b=x (al); sum (b)