Jacob dreams himself in a sweet shop, it contains an infinite amount of pastry. He is allowed to select n Pastry. There are pastries of k different sizes. From each size there are also infinitely many...

Extracted text: Jacob dreams himself in a sweet shop, it contains an infinite amount of pastry. He is allowed to select n Pastry. There are pastries of k different sizes. From each size there are also infinitely many pastries. Jacob wants to have at least one pastry of each size, but still there are a lot of possibilities for his selection. In his effort to make a decision he wakes up. Now he asks your help to develop a C# to find out how many possibilities for his selection he would have had. Assume that pastry of equal size can't be distinguished, and the order of the pastry is irrelevant. No. Test Case Result 1 1 126 105