[问答题]
The weights of the edges
scztomr,4 h3* omf0*po(/b46g 4osp3bdirq; u zf 8n nin the complete graph $boldsymbol{G}$are given in the following table.
1. Starting at vertex A, use the nearest-neighbour algorithm to find an upper bound for the travelling salesman problem for graph $\boldsymbol{G}$.
2. By first deleting vertex A, use the deleted vertex algorithm together with Kruskal's algorithm to find a lower bound for the travelling salesman problem for $boldsymbol{G}$ .
