WRITE THE CODE IN PYTHON.

Let G = {(x,y) l where x,y in nodes) be the connection map of a network. Eg. G1= [[1,0], [1,8], [4,3], [1,9], [5,6), 12,10], [7,15], [14,15], [6,14]. [5,13], [12,13]] is list of lists in python. Implement the following functions [[0,1,8,9], [2,10], [3,4],[5,6,7,12,13, 14, 15], # return all connected components. [11]] as a list of a lists. def connected_components (GraphG): E.g