A bipartite graph is drawn on a channel if the vertices of onepartite set are placed on one line in the plane (in some order) andthe vertices of the other partite set are placed on a line parallelto it and the edges are drawn as straight-line segments betweenthem. Prove that a connected graph G can be drawn on a channelwithout edge crossings if and only if G is a caterpillar.(***Please do on paper)
