\includegraphics[max width=\textwidth, alt={}, center]{1ecf9738-d968-49f6-8c70-0aa50b57cb69-10_629_951_276_596}
\(A D = 16\)
\(C D = 18\)
\(C F = 21\)
\(A C = 23\)
\(D F = 34\)
\(B E = 35\)
\(B G = 46\)
\(C \bullet \quad \bullet D\)
B
\(A B = 50\)
\(E G = 55\)
\(F G = 58\)
\(A E = 80\)
\(A F = 100\)
\includegraphics[max width=\textwidth, alt={}, center]{1ecf9738-d968-49f6-8c70-0aa50b57cb69-10_497_56_1073_1084}
\(E\)
G
Total weight of arcs in minimum spanning tree \(=\) \(\_\_\_\_\)
\(\_\_\_\_\)
Weight of spanning tree for the network with vertex \(G\) removed = \(\_\_\_\_\)
Lower bound for travelling salesperson problem on original network = \(\_\_\_\_\)
\(\_\_\_\_\)
Upper bound for travelling salesperson problem on original network = \(\_\_\_\_\)