In C

Implement and test the following function using a recursive solution: long choose (int x, int k) which takes n and k and computes(a) using Pascal's Rule. Note that the return type is a long - which is a 64-bit integer allowing you to compute values up to 263-1- 9,223, 372, 036, 854,775,807 (a little over 9 quintillion). Write a main function that takes n and k as command line arguments and outputs the result to the standard output so you can easily test it. Implement and test the following function using a recursive solution: long choose (int x, int k) which takes n and k and computes(a) using Pascal's Rule. Note that the return type is a long - which is a 64-bit integer allowing you to compute values up to 263-1- 9,223, 372, 036, 854,775,807 (a little over 9 quintillion). Write a main function that takes n and k as command line arguments and outputs the result to the standard output so you can easily test it