An alternative way to calculate the binomial coefficient is a recursive routine. This uses the following recursion rule:

If k = 1 or k = n, the recursion can be terminated. Implement a recursive method long BinomialStupidRecursive (long n, long k) that uses this calculation principle. Up to which input values is the calculation still correct?

| ? ? + | ||