Just looking for a drawn decision tree diagram with pruning.

Chapter 1: Brute Force January 22, 2020 Exercise 1 (Combinations by Brute Force) Consider the combinations problem: given integers n > 0 and k > 0, with n >= k, list all the ways to choose k things out of n (use n distinct symbols). Assume that order doesn't matter, in the sense that ab and ba are considered the same, so it's easiest to use words that have the letters in alphabetical order, like abc instead of ach or any of the other permutations of those three symbols. For example, with n = 4 and k = 2, the desired list is ab, ac, ad, bc, bd, cd Design nodes and decisions to build a tree of possibilities for the instance with n=5 and k= 3. Chapter 1: Brute Force January 22, 2020 Exercise 1 (Combinations by Brute Force) Consider the combinations problem: given integers n > 0 and k > 0, with n >= k, list all the ways to choose k things out of n (use n distinct symbols). Assume that order doesn't matter, in the sense that ab and ba are considered the same, so it's easiest to use words that have the letters in alphabetical order, like abc instead of ach or any of the other permutations of those three symbols. For example, with n = 4 and k = 2, the desired list is ab, ac, ad, bc, bd, cd Design nodes and decisions to build a tree of possibilities for the instance with n=5 and k= 3