Clone Graph

Given a connected undirected graph with nodes labelled 1..n and an adjacency list, deep-copy it and print the adjacency list of the copy (neighbours in ascending order, one node per line as 'node: neighbours').

0 <= n <= 100 No self loops or repeated edges