The

output should have $5$ numbers per line separated by commas.

After the function has displayed all n values, only one new line

should be at the end of the list of numbers. Display the CPU

time required to run the function on a new line after it has

printed out all of the prime numbers.

function $[]=$disp$\_$prime$($n$)$

$\%$ This function is the starting point for the disp$\_$prime bonus

$\%$ assignment. Your task is to modify this code so it will run

$\%$ faster. Your bonus will be determined by how much faster your

$\%$ code runs in comparison to this code.

$\%$ The input value n is the number of prime numbers to display.

$\%$ There is no function output but the code displays prime

$\%$ numbers in the command window.

tic; c$=0$; v$=2$; $\%$ Initialize values

if n$<mn>1</mn>$ disp$(\text{'}$No primes'$)$; $\%$ Check for valid input

else

if n$>=1$ fprintf$(\text{'}2,\text{'})$; c$=1$; end

if n$>=2$ fprintf$(\text{'}3,\text{'})$; c$=2$; end

if n$>=3$ v$=5$;

while c