A bag contains 20 marbles. These marbles are identical, except they are labeled with the integers 1 through 20. Five marbles are drawn at random from the bag. There are a few ways to think about this. a. Marbles are drawn one at a time without replacement. Once a marble is drawn, it is not replaced in the bag. We consider all the lists of marbles we might create. (In this case, picking marbles 1; 2; 3; 4; 5 in that order is different from picking marbles 5; 4; 3; 2; 1.) b. Marbles are drawn all at once without replacement. Five marbles are snatched up at once. (In this case, picking marbles 1; 2; 3; 4; 5 and picking marbles 5; 4; 3; 2; 1 are considered the same outcome.) c. Marbles are drawn one at a time with replacement. Once a marble is drawn, it is tossed back into the bag (where it is hopelessly mixed up with the marbles still in the bag). Then the next marble is drawn, tossed back in, and so on. (In this case, picking 1; 1; 2; 3; 5 and picking 1; 2; 1; 3; 5 are different outcomes.) For each of these interpretations, describe the sample space that models these experiments

Graphical transformations: y=− f (x)reflectsy= f (x)about x−axis y= f (−x)reflectsy= f (x)aboutthe y−axis y= f (x)+cshiftsy= f (x)¿theupcunits y= f (x)−cshifts y= f (x)¿thedowncunits y= f x+c )shfits y= (x)¿the¿units y= f x−c shfits y= fx ¿the¿cunits y=cf (x)stretches y= f (x)verticallybyc y= ( f (x))compresses y= f (x)verticallybyc c y= f cx compresses y= f (x)horizontally byc 1 y= f ( ) stretchesy= f (x)horizontallybyc c Combinations of functions: ( f ±g¿ (x)= f (x)±g(x) (fg)x)= f x g x ) f f(x) () (x)= provided g(x)≠0 g g( ) f For (f ±g)(x),(fg)x),∧ (g x , the domain is the intersection of f and g, but for f (x) , make g(x) cannot equal 0. (g Composite of f & g: (f ∘g)x = f (g(x) o In general, f ∘g≠g∘ f But f ∘g=g∘ f when f =g f ∧gundoeachother