Im trying to program this problem in C programing language. But I dont quite get what the problem is asking for or how to construc the program that will exicute the answers to it. I could use alot of help

Suppose that we have n distinct objects. There are many different orders that we can select to line up the objects in a row. In fact, there are n! orderings, or permutations, that can be obtained with n objects. If we have n objects, and select k of the objects, then there are n!/(n - k)! possible orderings of k objects. That is, the number of different permutations of n different objects taken k at a time is n!/(n - k)! . Write a function named permute that receives values for n and k, and then returns the number of permutations of the n objects taken k at a time. Assume that the corresponding prototype is int permute(int n,int k); b. Whereas permutations (part a) are concerned with order, combinations are not. Thus, given n distinct objects, there is only one combination of n objects taken n at a time, but there are n! permutations of n distinct objects taken n at a time. The number of combinations of n objects, taken k at a time is equal to

n!/((n - k)! (k!)) Write a function named combine that receives values for n and k and then returns the number of combinations of the n objects taken k at a time. Assume that the corresponding prototype is int combine(int n, int k);