Consider the following TSP distance data between six nodes. The goal is to find shortest closed tour.$($a$)$ Identify an upper bound of the TSP$.($b$)$ Identify a lower bound for the TSP$.($c$)$ Find the solution of TSP using B & B approach. At each node, solve the corresponding as sigument problem using the Hungarian method. Use the following strategy: Node Selection: When there are several active nodes, select the node with best bound. Branch Selection: When there are several open branches, pick the branch, whose vari able corresponds to longest distance.Subtour Selec