1. Write an algorithm to compute the number of combinations of n things taken k at a time:

using recursive function calls to a factorial function. Further, also write the algorithm to compute the factorial of the given integer.