Aset of cities v is connected by a network of roads g(v, e). the length of road e ∈ e is le. there is a proposal to add one new road to this network, and there is a list e0 of pairs of cities between which the new road can be built. each such potential road e 0 has an associated length. as a lobbyist for for city s, you wish to determine the road e 0 ∈ e that would result in the maximum decrease in the driving distance between s and a particular city t. give an efficient algorithm for solving this problem, and analyze its running time as a function of |v |, |e| and |e0

c

step-by-step explanation:

the solution of the equation is 2.23 ⇒ answer b

step-by-step explanation:

* lets revise the meaning of exponential function

- the form of the exponential function is y = ab^x, where a ≠ 0, b > 0 ,  

  b ≠ 1, and x is any real number

- it has a constant base b

- it has a variable exponent x

- to solve an exponential equation, take the log or ln of both sides,  

  and solve for the variable

* lets solve the problem

∵

- the base is 7 and the exponent is x

- insert ㏑ in both sides

∴

- use the rule

∴ x ㏑(7) = ㏑(77)

- to find x divide both sides by ㏑(7)

∴

* the solution of the equation is 2.23 to the nearest 2 decimal places

45.36 feet per second

step-by-step explanation:

tyrone travels 30 miles in 58.2 minutes.  

1 mile = 5280 feet; this means he travels

30(5280) = 158400 feet in 58.2 minutes.

1 minute = 60 seconds; this means he travels 158400 feet in

58.2(60) = 3492 seconds.

this gives us the unit rate of

158400/3492 = 45.36 feet per second.