Pls show all the work in a piece of paper. b$)$ Create a state$-$space tree to design a Branch && Bound algorithm to find all the solutions for the matrix given in problem #$1$ Note that approaches other than creating a state$-$space tree for this algorithm won$$t get credit. Show all your work Your work starts here

$(2$ points$)$ Create a state$-$space tree to design a backtracking algorithm to find all the solutions

for the following matrix $M.$ Note that approaches other than creating a state$-$space tree for

this algorithm won't get credit. Show all your work