Suppose you are at the library and you need to visit the computer lab, the food court, the administration building, and the campus police before returning to the library. The distances (in yards) between each of the places that you wish to visit are listed in the table below. Find the distance you will travel if you use the Greedy Algorithm to find a short route that starts and ends at the library.