Subject- computer Graphics Please don't copy from other answers.. (All answers are wrong) I need the correct solution . Note - we have to solve this question manually.. I don't want the program. Hint -- We can use the Cohen Sutherland Line Clipping Algorithm to solve this question. Step by step according to algorithm

A clipping window ABCD is specified as A(0,0), B(60,0),C(60,40),D(0,40). We want to clip two lines P(-15,70) Q(20,30) and R(50,10) S(70,70) against the window. Use the end point codes of the line to find out if the lines are totally invisible or partially visible. Use a standard clipping algorithm to find visible portion of the lines