$[94]$: $,n=50$

friends $=$ graph.$ge{n}_{r}ando{m}_f$riends $(n)$

We can visualize the social network in a graph format:

graph.draw$\_$matrix$($friends$,$ show$\_$weights$=$False$)$

Now we need to find all the separate friend groups. Because we are defining friend groups as including "friends of friends", we just need to find the connected components!

Check your answers:

n$\_$group$\_$friends $=41$

Check your answers:

How many people are in the largest friend group? Store this number as max$\_$group$\_$size

max$\_$group$\_$size $=41$