Python Code

LimitedBinomialCoefficient Description Thebinomial coefficientBN, K) is defined for integers Nand K sucht hat Osks N as follows: BIN, K) = factorialN) / (factorial(K) factorial/N-K) factorial(0) - 1 factorial(L) = 123...(L-1) LifL> 0 For example, B(5, 3) = 10, because B(5, 3) = factorial(5)/ (factorial(3}factorial(2)= (12345)/((123)(12)= 12 0/(62)=120/12-10 Write a function: def solution N, K) that, given two integers N and K, returns the value of BIN, K). The function should retum-1 if the result exceeds 1,000,000,000 The function should return-1 if the result is undefined. For example, given N = 5 and K = 3 the function should return 10, as explained above. Given N = 40 and K = 20, the function should retum -1, because B(40 20) exceeds 1,000,000,000 (indeed, B(40, 20) = 137,846,528,820). Given N = 3 and K = 5, the function should return -1, because the res ult is undefined Assume that: Nand K are integers within the range (-2,147,483,648.2,147,48 3,647) Input given two integers N and K Nand K are integers within the range (-2,147,483,648.2,147,48 3,6471 Output Returns the value of B(N, K). The function should return -1 if the result exceeds 1,000,000,000 The function should return-1 if the result is undefined. Sample Input 1 ) Sample Output 1 75582 19 8 Language: Python3 Theme: Solarized Light 1 def solution (N, K): 2. # write your code in Python 3.6 3 pass 4 5 if __name _main_": q = (int(input()), int(input())) 7 print (solution(*)) 8 9 5 00