Write a function prime isolated (a,b) that returns as output (argument) ALL prime numbers p in the interval Da, bl (inclusive) for which neither p 2 NOR p 2 are prime numbers (which are called isolated primes). The "Sieve of Eratosthenes s://en.wikipedia.org/wiki/Sieve of Eratosthenes is the simplest way to find prime numbers, but you can choose a different algorithm. (Do NOT use the built-in MATLAB function isprime other than to check your results.) When given only one input, your function should find all isolated primes in the interval [1,a]. You must VERIFY that the numbers your function found are isolated primes (e.g. by comparing it to lists of isolated prime numbers or using the built-in MATLAB function isprime)