Question 3
Let $n$ be a positive integer. At a party of $n$ people, each pair either are acquainted with each other or are not. What is the maximum possible number of pairs who are not acquainted but have a common acquaintance among the participants?