4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{23cc3c59-35d8-4120-9965-952c0ced5b3d-5_846_798_205_639}
\captionsetup{labelformat=empty}
\caption{Figure 4
[0pt]
[The total weight of the network is 359 cm]}
\end{figure}
Figure 4 represents the network of sensor wires used in a medical scanner. The number on each arc represents the length, in cm, of that section of wire.
After production, each scanner is tested.
A machine will be programmed to inspect each section of wire.
It will travel along each arc of the network at least once, starting and finishing at A. Its route must be of minimum length.
- Use the route inspection algorithm to find the length of a shortest inspection route. You must make your method and working clear.
The machine will inspect 15 cm of wire per second.
- Calculate the total time taken, in seconds, to test 120 scanners.
It is now possible for the machine to start at one vertex and finish at a different vertex. An inspection route of minimum length is still required.
- Explain why the machine should be programmed to start at a vertex with odd degree.
Due to constraints at the factory, only B or D can be chosen as the starting point and there will also be a 2 second pause between tests.
- Determine the new minimum total time now taken to test 120 scanners. You must state which vertex you are starting from and make your calculations clear.
(4)