What is the primary disadvantage of the Cohen$-$Sutherland algorithm?

$-$ A$)$ It is complex to implement

$-$ B$)$ It is slow for large numbers of lines

$-$ C$)$ It cannot handle concave polygons

$-$ D$)$ It requires floating$-$point arithmetic