(30 points) Let's say you want to select participants on a social network for a game show One condition you want is to minimize collusion among the participants. Because of that, the participants must not know each other. We can model this as a graph problem. Given an undirected graph (representing a social network), the goal of this problem is to enumerate through (or print out) all sets of complete strangers in this graph. A set of complete strangers in a graph is a set of vertices that have no edges among them. Recall that this backtracking function below prints out all sets: def sets(i, solution): if=len (solution)-1 print(solution) else: for item in [False, True]: solution[i+1] = item sets(i+1, solution) Modify it so that when you find a complete solution check to make sure that it is a group strangers. In other words, your backtracking function will print out all sets of strangers in a graph