Added program of Sutherland-Hodgman algorithm

[0-SiddharthJoshi-0]

The Sutherland-Hodgman algorithm is used for polygon clipping, a process in computer graphics where a polygon is clipped against a defined clipping window. This algorithm helps determine the part of the polygon that lies within the clipping area, usually a rectangular or convex polygonal window.

Given a polygon with n vertices and a convex clipping window, the goal is to clip the polygon so that only the portion inside the window is retained. The algorithm iteratively clips the polygon edges against each edge of the clipping window, modifying the polygon by adding or removing vertices based on their positions relative to the window.

[indrakishore]

No description provided.

Please add problem statement and approach in code file also rename file name as protocol.

[0-SiddharthJoshi-0]

I have added description