(a) Consider the image segment in Figure Q1(a). 42 1 1 2 1 3 3 91 3 2 0 2 2 1 2 1 2 1 1 0 3 1 2 2 0 Figure Q1(a) i) Let V = {0, 1}, compute the possible lengths of the shortest 4-neighborhood and 8- neighborhood between p and q2. If a particular path does not exist between these two points, please provide the justification. ii) If the shortest length between p and ql is 4, what is the set of gray V and verify which path is possible? What adjacency used to get length equal to 4? (a) Consider the image segment in Figure Q1(a). 42 1 1 2 1 3 3 91 3 2 0 2 2 1 2 1 2 1 1 0 3 1 2 2 0 Figure Q1(a) i) Let V = {0, 1}, compute the possible lengths of the shortest 4-neighborhood and 8- neighborhood between p and q2. If a particular path does not exist between these two points, please provide the justification. ii) If the shortest length between p and ql is 4, what is the set of gray V and verify which path is possible? What adjacency used to get length equal to 4