There are 4 cheerleaders in a cheer squad: jessie, kelly, lisa, and tori. creating a cheer pyramid only requires 3 cheerleaders. if all cheerleaders are equally likely to be selected, what is the probability that kelly will be on top of the pyramid?
(there is more than one way that kelly can be on top of the pyramid)

- "runner b is moving at a slower rate."

- "the graphs shown are graphs of distance(km) against time(min).

the slopes of this graphs are are given by:

slope = (change in y)/(change in x)

= (change in distance)/(change in time)

this is the formula for finding the speed. so, the slope of these graphs represent the speed of the runner.

taking each division in the graph to represent 1 on both axis:

runner a ⇒ speed = (2-0)/(1-0)

= 2/1

= 2 km/min

runner b ⇒ speed = (3-0)/(3-0)

= 3/3

= 1 km/min

this shows that   runner b is moving at a slower rate."

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

step-by-step explanation:

two pairs of adjacent sides are of equal length. this implies that one diagonal divides the kite into congruent triangles, and so the angles between the two pairs of equal sides are equal in measure. it also implies that the diagonals are perpendicular.

c.)

step-by-step explanation: