1- Consider the image window shown below, compute DA and Dg for the shortest path from pixel P to Q1, and from P to Q2, for an image with the gray levels given by; i- V={2,3} as an object and the rest of other gray levels as background. (0,0) 31 201 3 1 2 2 92 2 4 3 2 2 2 1 4 P (4,4) i- Leave the background cells empty and insert 1 for the objects, where the objects gray levels belong to V={2,3} ii- Calculate the 4-connected shortest path PQ1 PQ1= iii-Calculate the 8-connected shortest path PQ2 iv-Leave the background cells empty and insert 1 for the objects, where the objects gray levels belong to V={1,2} V- Calculate the 4-connected shortest path PQ1 PQ1= vi-Calculate the 8-connected shortest path PQ2 1- Consider the image window shown below, compute DA and Dg for the shortest path from pixel P to Q1, and from P to Q2, for an image with the gray levels given by; i- V={2,3} as an object and the rest of other gray levels as background. (0,0) 31 201 3 1 2 2 92 2 4 3 2 2 2 1 4 P (4,4) i- Leave the background cells empty and insert 1 for the objects, where the objects gray levels belong to V={2,3} ii- Calculate the 4-connected shortest path PQ1 PQ1= iii-Calculate the 8-connected shortest path PQ2 iv-Leave the background cells empty and insert 1 for the objects, where the objects gray levels belong to V={1,2} V- Calculate the 4-connected shortest path PQ1 PQ1= vi-Calculate the 8-connected shortest path PQ2