Question: Q2. Solve the travelling salesman problem using the following heuristics based on the following network. For each heuristic, report the tour found and its length. Begin both techniques at node 1. Include all details that justify your work.(a) Nearest Neighbor. What is the minimum-cost tour?(b) Nearest Insertion.

Q$2.$ Solve the travelling salesman problem using the following heuristics based on the following network. For each heuristic, report the tour found and its length. Begin both techniques at node $1.$ Include all details that justify your work.

$($a$)$ Nearest Neighbor. What is the minimum$-$cost tour?

$($b$)$ Nearest Insertion.