A Salesman must visit from city to city to maintain his accounts. He must leave his home city and visit other cities once and return home. The cost of going from city to city is shown in table. Find the least route? Use LC branch and bound methodology to solve problem? (10M) city 1 city2 city3 City4 City5 City1 0 3 5 9 18 City2 7 0 8 3 14 City3 3 6 0 5 9 City4 12 14 6 0 8 City 5 8 9 18 11 O