In 2199, humankind was finally able to overcome intergalactic distances. The World Space Agency has connected n galaxies using m two-way intergalactic teleport routes. For teleport route e, the cost of travel is cle) > O quantum-dollars. It is possible to use a teleport several times, but for each use you have to pay cle). Mike wants to travel from galaxy s to galaxy t at the lowest possible cost. However, because Mike has only 5- quantum-dollar coins, the total cost of the trip should be a exact multiple of 5. A) Design an algorithm that suggests a path with the lowest possible cost to Mike, where the cost must be a multiple of 5. B) Solve problem (A) assuming that Mike has a ticket for a free teleport