. Write a function with header out = myIsPrime(n) where out is 1 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 , and stop as soon as it determines that n is not a prime. Test you function for n = 1 (which is not a prime), 2, 3, 77, 97, and prod(myvec)+1. [using matlab]