In your class, many students are friends. let’s assume that two students sharing a friend must be friends themselves; in other words, if students 0 and 1 are friends and students 1 and 2 are friends, then students 0 and 2 must be friends. using this rule, we can partition the students into circles of friends. to do this, implement a function networks() that takes two input arguments. the first is the number n of students in the class. we assume students are identified using integers 0 through n 1. the second input argument is a list of tuple objects that define friends. for example, tuple (0, 2) defines students 0 and 2 as friends. function networks() should print the partition of students into circles of friends as illustrated: > > > networks(5, [(0, 1), (1, 2), (3, 4)]) social network 0 is {0, 1, 2