After a grueling algorithms midterm, you decide to take the bus home. Since you planned ahead, you have a schedule that lists the times and locations...

After a grueling algorithms midterm, you decide to take the bus home. Since you planned ahead,

you have a schedule that lists the times and locations of every stop of every bus in Champaign-

Urbana. Unfortunately, there isn’t a single bus that visits both your exam building and your home;

you must transfer between bus lines at least once.

Describe and analyze an algorithm to determine the sequence of bus rides that will get you

home as early as possible, assuming there are b different bus lines, and each bus stops n times per

day. Your goal is to minimize your arrival time, not the time you actually spend traveling. Assume

that the buses run exactly on schedule, that you have an accurate watch, and that you are too

tired to walk between bus stops.