The feasible region of a linear programming problem has vertices (-1,-2), (0,7), (2,5), (5,3), (8,-1) find the minimum and maximum values of the objective function C(x, y)=15x+9y

54 km / hours

step-by-step explanation:

we need to convert seconds to hours

60 seconds = 1 minutes

60 minutes = 1hour

15 m         60 second   60 minutes

  * *         = 54000 meters/ hour

second     1 minute             1 hour

now we need to convert meters to km

1000 m = 1 km

54000 m       1 km

*   = 54 km / hours

hour               1000m

step-by-step explanation:

659

hello! just here for points! though i wish i knew!

look at photo