The table shows the time, in milliseconds, it takes to send a packet of data between computers on anetwork. If data needed to be sent in sequence to each computer, then notification needed to come backto the original computer, we would be solving the Traveling Salesman Problem. The computers are labeledA-F for convenience.BCD| E124041AF44 | 3424 | 50203927B443143C3431D12 43201117E40| 24 | 3950 | 271142F4117 | 42Find the circuit generated by the Nearest Neighbor Algorithm starting at vertex B.The Nearest Neighbor Algorithm circuit from B iswith timemilliseconds.Find the circuit generated by the Repeated Nearest Neighbor Algorithm.The Repeated Nearest Neighbor Algorithm found a circuit with timemilliseconds.回 S 二

We will use NEAREST NEIGHBOR ALGORITHM.Starting at vertex B, the nearest neighbor is vertex E with a weight of 24 milliseconds. From E, the nearest neighbor is D, with a 11 milliseconds. From D, the nearest neighbor is A, with a time of 12 milliseconds. From A, the nearest neighbor is F. with a time of 41 milliseconds. From F, the nearest neighbor is C, with a time of 27 milliseconds. From C, return to B, with a time of 31. The resulting circuit using the nearest neighbor algorithm circuit from B is BEDAFCB, with total milliseconds of 24+11+12+41+27 +31= 146 ms. The Nearest Neighbor Algorithm circuit from B is BEDAFCB with time 146 milliseconds.Do the Nearest Neighbor algorithm using each of the vertexes as the starting point. Start with A: The resulted circuit is ADEBCFA with the time of 12+11+24+31+27+41-146 milliseconds Start with B: The resulted circuit is BEDAFCB with the time of 24+11+12+41+27+31=146 milliseconds. This is the same circuit as starting at A Start with C: The resulted circuit is CDEBAFC with the time of 167 milliseconds Start with D: The resulted circuit is DEBCFAD with a time of 146 milliseconds. This is the same circuit as starting at A. Start with E: The resulted circuit is ADEBCFA with a time of 146 milliseconds. This is the same circuit as starting at D, A and B. Start with F: The resulted circuit is FDEBCAF with a time 158 milliseconds. Therefore, the circuit with the minimal total weight is ADEBCFA or BEDAFCB or DEBCFAD, with a time of 146 milliseconds The Repeated Neighbor Algorithm found a circuit with time 146 milliseconds.