Problem 1 In mathematics, a combination is a selection of items from a collection, such that the order of selection does not matter [1]. The number of k-combinations from a given set S of n elements is often denoted by fiunction C(n, k)--B kln-k) write a function in C which receives , and k and calculates C(n, k)