Which of the following problems is solved by using Branch and Bound method?ans.prim's algorithmBFSDFStravelling salesman problem

The Branch and Bound method is used to solve the Travelling Salesman Problem.

Here's a step-by-step explanation:

1. The Branch and Bound method is an algorithmic strategy used in decision tree algorithms, where we divide the problem into subproblems and solve them individually.

2. The Travelling Salesman Problem is a classic algorithmic problem in the field of computer science and operations research. It focuses on optimization. In this problem, a salesman is given a list of cities, and must determine the shortest possible route that allows him to visit each city once and return to his original location.

3. The Branch and Bound method is used to solve this problem by creating a tree of subproblems to represent different tour possibilities. The method "branches" by selecting a city and "bounds" by ignoring routes that are likely to be longer than the current best solution.

4. Therefore, the Branch and Bound method is used to solve the Travelling Salesman Problem, not Prim's algorithm, BFS, or DFS.