Question

It is 6am in Kuala Lumpur. A mail carrier needs to make their rounds, and being very experienced, they can accurately estimate the time it will take them to travel between the different places they need to visit. They will start at the depot, visit every stop and return to the depot. The times between each of the stops and the depot is given in We now need to write an algorithm which solves the problem above for an arbitrary number of stops n. Note that the input table should have dimensions n Times n, but it need not be symmetric, i.e., the time from stop A to stop B may not be the same as the time from stop B to stop A. This is due to traffic congestion during peak hour. Your algorithm must use brute force to solve this problem. Decompose your problem using different modules to make your algorithm readable. Write all of the modules needed using pseudocode and use comments to make your solution as readable as possible. The main module should use the following signature: In other words, it must generate all possible routes for the mail carrier, and then determine which will requries the least time. BruteForceMailProblem(T[o..n-1, o..n-1 ]) INPUT: A table of times, where T[i,j] indicates the time it takes to travel from location ito location j OUTPUT: A list of the locations to be visited in order to minimize total time (this list must be in the correct order). ASSUMPTIONS: Stop 0 is the depot, i.o. T[0,J] is the time from the depot to stop j.

Answer 1

INPuT: A table o times, wher TL, inolicates the time Et takes Lo tsavel tiom lecationito location d OuTPuT A lut o the Aecalions to be visted in onde to minimize total me AsSuMPTNS Stop O is the ole pet, e TID ts the time 4Hom the depet to stop d clion hontest pot h minimum := p pnint Bmbnded Path (n-, minimum)

unctien hontestpathc) on m to n- Ta L io e se

print puin