Whichalgorithm would you recommend be used to find the fastest route from the distribution center to each of the towns? Demonstrate how it would work on the example above if the distribution center is placed at town G. Show the resulting routes.

Asap (i need to finish this quick) graph complete the sequence of transformations that produces △x'y'z' from △xyz. a clockwise rotation ° about the origin followed by a translation units to the right and 6 units down produces δx'y'z' from δxyz.