In class lab $6$

$-$ In this lab you will be implementing a function that takes in an array of numbers and finds all numbers in the array that are prime numbers.

$-$ To Do:

$-$ In main take user input on how many numbers are to be entered into the array

Give me all things ask for here also give me whole code and the output screenshot too.

$-$ Take input of numbers from the user for the amount of numbers that was specified

$-$ Pass the array to a function that finds all prime numbers in the array of numbers entered

$-$ Return an array of prime numbers

$-$ Print all prime numbers

$-$ EVERYTHING MUST BE DONE IN POINTERS

$-$ The only things that do not need to be done using pointers are variables for interaction in for loops like for $($int $\backslash (\backslash$mathrm$\{$i$\}=0$ ; $\backslash$mathrm$\{$i$\}<mi>\backslash </mi>$mathrm$\{$x$\}$ ; $\backslash$mathrm$\{$i$\}++\backslash ))$;