Can someone help solve this

MDM 4U1 Binary method: In a set of / items, if you would like to how many subsets are possible containing from 0 up to n elements, you determine if each element is included or excluded, with the following formula: 2 X 2 X 2 X ... ..X_2 = 27 # of options # of options for including/ # of options # of options for including/ for including/ excluding for including/ excluding excluding FIRST excluding SECOND BORER YOA THIRD element element nth element element If you want to determine how many sets are possible with at least one element, you must get rid of the single nullset: The total number of subsets is now: 2" - 1 C. Practice! 1. You have a single nickel, dime, quarter, loonie and toonie in your wallet. How many sums of coins are possible? Try solving both ways! Direct method, with cases: Binary method: Euchre, only the 9, 10, J, Q, K and A from each