1. Branch and BoundTravelling Salesman Problem 2. Branch and Bound is a state space searchmethod in which all the children of a nodeare generated before expanding any of…
