Write a function named primeFinder that accepts a two$-$element vector of distinct positive integer values and finds all the prime numbers that lie between them. Your function

should have two output arguments:

A column vector of all the prime numbers that lie between the two inputs.

A scalar that counts the number of elements in the first output.

The two values in the input vector may not be in ascending order. You might find the function primes helpful.

Note the function command is given in line $1$ with suggested names for the input and output variables. You can change the names $($but not the order$)$ of these variables if you like.

Do not change the name of the function, however, as this exact name is required for the tests to run. Be sure to assign a value to the output variable.