write a java program to find the bound of this matrix through best$-$first branch$-$and$-$bound strategy.

matrix is

$01441020$

$140787$

$450716$

$117902$

$1871740$

output

$[1]-$ bound $21$

$[1,2]-$ bound $31$

$[1,3]-$ bound $22$

$[1,4]-$ bound $30$

$[1,5]-$ bound $42$

$[1,3,2]-$ bound $22$

$[1,3,4]-$ bound $27$

$[1,3,5]-$ bound $39$ just like this write all the value of bound of each path till it find the optimized solution.