6.4.43 Graph theory

condition: The digraph is specified by the adjacency matrix. It is necessary: ​​a) draw a graph; b) identify components of strong connectivity; c) replace all arcs with edges and find an Euler chain (or cycle) in the resulting undirected graph. \[ \left(\begin{array}{llllll} 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 & 1 & 0 \\ 0 & 1 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 1 \end{array}\right) . \]