The matrix below marks with a 1 each pair of the set of racers a, b, c, d, e, f who are to have a drag race together. it is most efficient if a racer can run in two races in a row (but not in three in a row). is it possible to design a sequence of races such that one of the racers in each race (except the last race) also runs in the following race (but not three in a row)? if possible, give the sequences of races (pairs of racers); if not, explain why not.

14

step-by-step explanation:

the inequality is:

250c+180g≥950

step-by-step explanation:

let c denotes the number of days in a week   miyoko worked as a cryptographer.

and g denotes the number of days in a week she works as a geologist.

now we are given that she earns $250 for every day she works as a cryptographer,and earns $180 for every day she works as a geologist.

now miyoko's goal is to earn more than $950 this week.

hence, the inequality could be represented as:

250c+180g≥950

b. 153 students do not participate in sports and seventy-five 12th graders were surveyed

66.666666667%

step-by-step explanation:

divide 150 by 100

divide 100 by 1.5

there you go!

decreased by 33.333333334%