[问答题]
The weighted graph $\boldsymbol{H}$, representing the travelling costs between five customers, has the following weighted adjacency table.
1. Draw a possible graph of $\boldsymbol{H}$ .
2. Starting from customer $\mathrm{E}$ , use the nearest-neighbour algorithm to determine an upper bound to the travelling salesman problem for $\boldsymbol{H}$ .
3. By removing customer A, use the method of vertex deletion to determine a lower bound to the travelling salesman problem for $\boldsymbol{H}$ .
