Let A = {x Z | 0 x < 10}. i. How many subsets of size 3 can we make? ii. How many ways can we partition A into 3 subsets, assuming any of the new sets can be empty? iii. How many ways can we partition A into 3 subsets, assuming all new sets must be non-empty? iv. How many 4-tuples can we make using only elements of A, assuming all numbers must be different? v. How many 4-tuples can we make using only elements of A, assuming numbers can be repeated