Describe the recurrent states on the following graph:

vertices $(i,0),(i,1)$ for integer $i,0iN$ edges

$(i,0)$ is connected to $(i+1,0),(i-1,0),(i,1),(i+1,1)$

$(i,1)$ is connected to $(i-1,1),(i+1,1),(i,0),(i-1,0)$

and sinks are $(0,0),(0,1),(N,0),(N,1)$

and corresponding trees

$($using Dhar burning algorithm$)$ I$$ think i$$ should describe two questions:recurrent states and corresponding trees.

I$$