How many keys are needed for symmetric$-$key communication in a community with n entities?

$$ a$.$ n$($n$-1)$ keysare needed

O b$.$ n$($n $-1)/3$ keys are needed

$$ c$.$ n$($n$-1)/2$ keys are needed

$$ d$.$ n$($n$-1)/4$ keys are needed