Correct Answer : 9
Explanation : If the line is neither a visible case nor an invisible case, then it will be considered to be the clipped case.
The Cohen-Sutherland algorithm will divide the 2D space into nine regions.
All nine regions are assigned codes. Each code is of 4 bits. If both endpoints of the line have end bits zero, then the line is considered to be visible.
