Compute the MAP solution to the three-pixel graph-cut problem in Figure XXXXXXXXXXby (i) com- puting the cost of all eight possible solutions explicitly and finding the one with the minimum cost (ii)...

1. 
   

   
   Compute the MAP solution to the three-pixel graph-cut problem in Figure 12.36 by (i) com- puting the cost of all eight possible solutions explicitly and finding the one with the minimum cost
   

   
   

(ii) running the augmenting paths algorithm on this graph by hand and interpreting the minimum cut.