python question!

show code and step!

Lab Question 5 (Binomial Coefficient) 15 points]: The binomial coefficient "n choose k", corresponds to the number -element subsets of a set with n elements, 0 ks n. t is defined by Sk n! (R) where n!, "n factorial is as in the course notes. Write a Python function cf C (n, k) that computes the a binomial coefficient this way. An alternative definition for the binomial coefficient by through recursion: 1) if 15 k m Write a function crec (n, k) that computes the binomial coefficient this way. Put both functions in the file Q5 you. Try to find out which of these is faster. Add your observations as comments to the file Note that you can use the two implementations to check each other, you do not have to include your test cases. Examples c fac (4 2) rec (3 2)