Branch and bound is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. As a solution Branch and bound algorithm was developed by Narendra and Fukunaga in 1977 As Generally, the Branch and bound method is applied for optimized problem, any problem that we…