b$)$ The figure below shows a binary image patch.

${\displaystyle \underset{i=0}{\overset{?}{}}}$

$p_i=$ probabligio

$I=\left[\begin{array}{ccccccccc}0& 0& 0& 0& 1& 0& 0& 0& 1\\ 0& 0& 0& 0& 1& 0& 0& 0& 1\\ 1& 0& 0& 0& 1& 0& 0& 0& 1\\ 0& 1& 1& 1& 1& 0& 0& 1& 0\\ 0& 0& 1& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 1& 0& 1& 0& 1& 0\\ 0& 0& 0& 0& 0& 0& 0& 1& 1\\ 0& 0& 0& 0& 1& 0& 0& 1& 0\end{array}\right]$

By searching the $4-$neighbourhood, and by suitably illustrating your steps, apply the two$-$pass equivalence class resolution $($or similar$)$ algorithm to recognise and label the connected components of this image patch. Repeat for $8-$neighbourhood.