In the lesson, we learned about the critical density threshold for the CFinder algorithm.

Suppose you are given a graph with $n=200$ nodes. You plan to identify its communities using

the CFinder algorithm with $k=3.$ What is the maximum number of edges in the graph so that

you can reliably apply this community detection method? $($hint: please select the closer

integer below$)$