Gway to campus he wants to choose the path that has the lowest expected waiting time at stop lights. he collects the following data for three different options: path a path b path c number p(wait) time p(wait) time p(wait) time 1 0.25 3 0.05 5 0.45 4 2 0.10 2 0.35 4 0.20 1 3 0.525 2 0.35 1 0.75 2 (a) (5 points) calculate the expected number of minutes he will have to wait for each path

22.83 repeating

step-by-step explanation:

137 ÷ 6 is 22.8333333 therefore we understand that 3 is repeating.

happy to

pls mark as brainliest

answer: b

step-by-step explanation:

134.6 us dollars

step-by-step explanation:

1 us dollar = 1.33 canadian dollars

so, 150 us dollars = 150 × 1.33 = $199.5.

in canada, the money mitchell spent = 20 canadian dollars.

remaining canadian dollars with him = 199.5 - 20 = 179.5.

after mitchell returned to us, he exchanged the remaining canadian dollars to us dollars.

179.5 canadian dollars = 179.5 × 0.75 = 134.6 us dollars.