What is the equivalent recursive definition for an = 12+ (n - 1)3? A. a1 = 3, An = An-1 + 12
B. a1 = 12, An = 30n-1
C. a1 = 12, Un = On-1 +3
D. a1 = n, an= 1201-1+3

Afriend of mine is giving a dinner party. his current wine supply includes 10 bottles of zinfandel, 8 of merlot, and 11 of cabernet (he only drinks red wine), all from different wineries. (a) if he wants to serve 3 bottles of zinfandel and serving order is important, how many ways are there to do this? ways (b) if 6 bottles of wine are to be randomly selected from the 29 for serving, how many ways are there to do this? ways (c) if 6 bottles are randomly selected, how many ways are there to obtain two bottles of each variety? ways (d) if 6 bottles are randomly selected, what is the probability that this results in two bottles of each variety being chosen? (round your answer to three decimal places.) (e) if 6 bottles are randomly selected, what is the probability that all of them are the same variety? (round your answer to three decimal places.)