Below are two jobs that need to be completed. Describe in explicit detail the algorithm that will achieve the listed objective most efficiently. In addition, identify a heuristic that you believe will best approximate the results of the algorithm and explain why you believe it would be an effective heuristic.

You have seven loads of laundry to do. There are two loads of bedding, which will each take 30 minutes to wash and 50 minutes to dry. A load of dress shirts, which take 25 minutes to wash and 40 minutes to dry using low heat. There are three loads of athletic clothes that will each take 20 minutes to wash and 30 minutes to dry. A load of underwear and socks, which will take 20 minutes to wash and only 20 minutes to dry. You have a single washing machine and a single dryer. Assume that you begin washing at 8 a.m. and your objective is to be finished with the entire process as quickly as possible. What order do you wash/dry the loads and how long will the washing take in total? Is there a rule of thumb that could be used to achieve [approximately] the same result, and if so, what is it? (1 point)

1. Find the shortest route between these five points, where the distance between each point is listed on the graph. You can start at any point and there is no restriction on how many times you can visit a point - just that each point must be visited at least once. (1 point)
2. Find the shortest route between these five points, where the distance between each point is listed on the graph. You can start at any point and there is no restriction on how many times you can visit a point - just that each point must be visited at least once. (1 point)