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

o= 4(i) +3

step-by-step explanation:

o is your output value and i is your input value. so, for example, if we stuck 7 in as our input, we would first multiply by 4 ( pemdas ), which equals 28. then we would add 3 to 28, for a total output of 31. this may not be a graph, but, it is a way to solve your formula..

the answer is ! ?

if y=4x then you will substitute 4x in for y in the second equation.

8x + 4x = 18 combine like terms

12x = 18 divide by 12 on both sides

x = 18/12 or 3/2

now replace x in the first equation with 3/2 to get

y = 4 3/2

y = 6

the answer is a

(3/2,6)

hope that .

brainliest is always apprectiated