1 0 1 0 10 1 0 0 1 1 1 0 1 1 0 0 1 0 0 1 0 0 1 1 0 0 1 1 1 0 1 0 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1 0 1 0 1 1 0 1 0 Given the above binary image, find its 4-way connected components by labelling it using Iterative and Recursive techniques. In each technique, highlight the following: label each connected component using a, b, c, (alphabetic labels) show timings of each pixel when labeling it. For example, if a pixel is labeled first, write t1 on it. If it is labeled second, write t2 on it. Basically show the timings of each pixel when it got labeled. find total unique labels, that is, total number of connected components. for Iterative technique, find all the equivalence classes. Show two separate labeled matrices, one before equivalence class, and one after applying equivalence class. Clearly mention number of connected components before and after. 1 0 1 0 10 1 0 0 1 1 1 0 1 1 0 0 1 0 0 1 0 0 1 1 0 0 1 1 1 0 1 0 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1 0 1 0 1 1 0 1 0 Given the above binary image, find its 4-way connected components by labelling it using Iterative and Recursive techniques. In each technique, highlight the following: label each connected component using a, b, c, (alphabetic labels) show timings of each pixel when labeling it. For example, if a pixel is labeled first, write t1 on it. If it is labeled second, write t2 on it. Basically show the timings of each pixel when it got labeled. find total unique labels, that is, total number of connected components. for Iterative technique, find all the equivalence classes. Show two separate labeled matrices, one before equivalence class, and one after applying equivalence class. Clearly mention number of connected components before and after