Permutations Complete the following function using a combination of branching and a for-loop to compute the number of permutations of n given k. (1) If k is greater than n, then the function is...

The code in is Matlab. This is what I have so far. I"m not sure what to do.

Extracted text: Permutations Complete the following function using a combination of branching and a for-loop to compute the number of permutations of n given k. (1) If k is greater than n, then the function is undefined and the number of permutations is NaN. (2) Otherwise, compute the function using the following formula. You may not use the built-in function factorial or perms in the function. n! P(n, k) : (n – k)! It is very inefficient to calculate the factorial of both the numerator and the denominator. Instead, you should use a for-loop to calculate the product of the terms in the numerator that are not cancelled by terms in the denominator. Consider the following example: 10 -9· 8·7·6·5·4·3·2·1 P(10,6) = = 10· 9· 8· 7·6·5 4·3·2·1