you are not required to use a specific programming language. Write the program in pseudocode.The number of combinations of n elements into k elements,

$,$ is the number of subsets with k elements that can be formed from a set with n elements, where n and k are non$-$negative numbers such that n $>=$ k$.$

is also known as the number of ways of choosing k elements from n indistinguishable elements. A recursive definition of it can be made as follows:

Use the previous definition to write a function that recursively computes all

for any $0<=$ k $<=$ n and n non$-$negative integers. $($LO $1\mathrm{.}2)$