Describe an algorithm to find a sequence of flights that minimizes the total time in transit—the length of time from the initial departure to the final arrival, including time at intermediate airports waiting for connecting flights.

idkidkdidkdkdidkx

step-by-step explanation:

nndncnd cnn

snddnd

$75.00

step-by-step explanation:

i = prt

i = 1,5000 * 0.025 * 2

i = 75

the equation of the parallel line would be y = 2x + 9

step-by-step explanation:

to start we need to find the slope of the original line. we can do that by looking at the coefficient of x, which is 2

since the slope of the original line is 2 and parallel lines have the same slope, we know the new line will also have 2 slope. now we can use that along with the point given in point-slope form to get the find equation.

y - y1 = m(x - x1)

y - 5 = 2(x + 2)

y - 5 = 2x + 4

y = 2x + 9

wow ok so the answer is 1k or just k

because of combining like terms xd