A recursive function is defined by $f(n, k) = f(n-1, k) + f(n-1, k-1)$ with base cases $f(n, 0) = 1$ and $f(n, n) = 1$. What does $f(n, k)$ represent?