8. Write a formula for each of the following combinatoric scenarios, in terms of the variables provided in each scenario. Please use choose notation where appropriate. You may not use ellipsis (...) in your fomrulas. Write your formulas as concisely as possible; you may be counted off for formulas that are too long or unwieldy. (Be careful with the variable names!): (a) There are s students in the class, and v versions of the exam. How many different ways can the exam versions be distributed among the students, if all the students are distinct (so we care about which student gets which exam, not just the number of students taking each exam)? (b) There are h distinct homework assignments, and you can drop any d of them. How many different combinations of dropped homeworks are there? V(e) There are a questions on a quiz. Every question is all-or-nothing (you get either full points or no points on the question). Let pi denote the number of questions that are worth i points. If q = m(+1) for some natural number m, and px = 1, how many possible quiz scores can you receive? (You are only counting the final scores here - Cone 3-point question and one 2-point question] is counted the same as (one 1-point question and two 2-point questions), since you get 5 points in each case.)