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.

ion

step-by-step explanation:

ion ion ion ion ion ion ion ion ion ion ion

the answer is a.

135 and 80

step-by-step explanation:

55.44 inches

step-by-step explanation:

part a. assuming a perfectly linear relationship, we can find the slope from the first two data points.

slope = m = (change in rainfall)/(change in years)

= (61.80 -62.33)/(2005 -2004) = -0.53/1 = -0.53

then the point-slope form of the equation of the line can be written as

y = m(x -h) +k . . . . . m = -0.53, (h, k) = (0, 62.33)

y = -0.53x +62.33 . . . x = years after 2004

part b. in 2017, x = 2017 -2004 = 13. then the predicted rainfall is

y = -0.53·13 +62.33 = 55.44 . . inches

the predicted rainfall in 2017 is 55.44 in.

it's 100

step-by-step explanation:

22, 28, 34, 40, 46

b)   f(n) = 6n + 16

  n = what is the number of the row ( 22 would be row 1) so if we replaced n with 1, we would get 22

c)   the  14th  row will have 100 seats

(1)   (2)   (3)   (4)   (5)   (6)   (7)   (8)   (9)   (10) (11) (12) (13) (14)

22 | 28 | 34 | 40 | 46 | 52 | 58 | 64 | 70 | 76 | 82 | 88 | 94 | 100

read more on -