Let G be a graph with n vertices (labeled 1, 2, 3,..., n) and m edges. Design an O(n+m) algorithm to arrange all lists in an adjacency list representation of G so that vertices occur in increasing order of vertex name on each list.