Question

7. a) Apply the Branch and Bound algorithms to solve the travelling salesman problem. Use suitable graph.

b) CompareBFS andDFS.

​

Answer 1

Sure I will do this question come at my home fast am waiting come come!