a simple graph, g, is said to have width 1 iff there is a way to list all its vertices so that each vertex is adjacent to at most one vertex that appears earlier in the list. prove that every finite tree has width one