The Algorithm. There are thirteen broken computers situated at the following set S of thirteen points in the plane:A=(1,10)D=(377,422)G=(941,500)J=(3,713)B=(976,9)E=(535,488)H=(225,583)K=(504,872)M=(22,997)C=(666,87)F=(775,488)I=(388,696)L=(560,934)At time t=0, a repairman begins moving from one computer to the next, traveling continuously in straight lines at unit speed. Assuming the repairman begins and A and fixes computers instantly, what path does he take to minimize the total downtime of the computers? List the points he visits in order. Your score will be ⌊40N⌋, where N=1000+⌊the optimal downtime⌋−⌊your downtime⌋, or 0, whichever is greater. By total downtime we mean the sum P∈S∑tP, where tP is the time at which the repairman reaches P.