____________ is one of the most useful principles of enumeration in combinationatorics and discrete probability.ans.Quick search algorithmSet theoryEuclid’s algorithmInclusion-exclusion principle Previous Marked for Review Next

____________ is one of the most useful principles of enumeration in combinationatorics and discrete probability.ans.

The counting rule that is used for counting the number of experimental outcomes when n objects are selected from a set of N objects where order of selection is not important is calledQuestion 8Select one:a.permutationb.None of these alternatives is correctc.combinationd.multiple step experiment

not an application of inclusion-exclusion principle?

How many numbers must be selected from the set {1, 2, 3, 4, 5, 6} to guarantee thatat least one pair of these numbers add up to 7

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.The test cases are generated such that the number of unique combinations that sum up to target is less than 150 combinations for the given input. Example 1:Input: candidates = [2,3,6,7], target = 7Output: [[2,2,3],[7]]Explanation:2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times.7 is a candidate, and 7 = 7.These are the only two combinations.Example 2:Input: candidates = [2,3,5], target = 8Output: [[2,2,2,2],[2,3,3],[3,5]]Example 3:Input: candidates = [2], target = 1Output: [] Constraints:1 <= candidates.length <= 302 <= candidates[i] <= 40All elements of candidates are distinct.1 <= target <= 40