In Python:

2. 25 points] There are n students (numbered 0 through n 1 in class, and they need to be partitioned into teams. The teams do not need to have the same size-some can have size 1, some can have size 2, and so on with no limit on team size. There are several requests from pairs of students some want to be on the same team, and others want not to be on the same team. Write a Python function everyone_happy(n, request same, request_different) that determines whether it's possible to satisfy all requests (returning True if possible and False if not). Here, request same is the list of all pairs of students requesting to be on