In Matlab pls

10. Write a function with header out = myls Prime (n) where out is l if n is prime and 0 otherwise. Assume that n is a strictly positive integer. Your function should use a while loop, check the divisibility of n by 2 and by odd numbers from 3 to vVn, and stop as soon as it determines that n is not a prime. Test you function for n- (which is not a prime),2, 3, 77, 97, and prod (myvec) +1 10. Write a function with header out = myls Prime (n) where out is l if n is prime and 0 otherwise. Assume that n is a strictly positive integer. Your function should use a while loop, check the divisibility of n by 2 and by odd numbers from 3 to vVn, and stop as soon as it determines that n is not a prime. Test you function for n- (which is not a prime),2, 3, 77, 97, and prod (myvec) +1