17 Consider a representation of graphs called "adjacency Gel | degree array" (ADA). For this graph its ADA is (1,3,3,2, 6, 2, 2, 1, 6, 3, 1, 1, 4,0 5,0 6, 3, 1, 2, 7, 7, 1,6 l.e. you list a vertex, then its degree, then its neighbors, and then the next vertex, its degree, and its neighbors, and so on