6.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{bd357978-6464-43fd-854f-4188b5408e91-08_638_1107_212_479}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\end{figure}
[The total weight of the network is \(320 + x + y\) ]
- State, with justification, whether the graph in Figure 4 is Eulerian, semi-Eulerian or neither.
The weights on the arcs in Figure 4 represent distances. The weight on arc EF is \(x\) where \(12 < x < 26\) and the weight on arc DG is \(y\) where \(0 < y < 10\)
An inspection route of minimum length that traverses each arc at least once is found.
The inspection route starts and finishes at A and has a length of 409
It is also given that the length of the shortest route from F to G via A is 140 - Using appropriate algorithms, find the value of \(x\) and the value of \(y\).