You spin a spinner with 5 sections: 1 yellow (y), 1 purple (p) 1 red (r), 1 blue (b), and 1 green (g) which is the sample space for one spin of this spinner a. {yp, pr, rb, bg, gy} b. {y, p} c. {y, p, r, g, o} d. {y, p, r, b, g}

D. {Y, P, R, B, G}

Step-by-step explanation:

The sample space is the possible outcomes

We could get

yellow (Y),  purple (p) , red (r),  blue (b), green (G)

The sample space is written inside brackets

{Y, P, R, B ,G}

Y, P, R, B, G ~apex

Step-by-step explanation:

she drove 134 miles

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol