Code Template:class Point:def _init_(self, x, y):self.x = xself.y = ydef_str_(self):" Returns a string showing the coordinates with the format (x,y) "--# -- YOUR CODE HERE --def_eq__(self, other):" Checks if two points pertain to the same coordinates ""# -- YOUR CODE HERE --def get_distance(self, other):" Calculates the distance between two points """# -- YOUR CODE HERE .-class Line:def _init_(self, point_a, point_b):self.points = (point_a, point_b]def_str_(self):" Returns a string containing all collinear points in the Line instance ""# -- YOUR CODE HERE --def get_slope_intercept(self):Calculates the slope of the line """# -- YOUR CODE HERE --def add_point(self, points):"u" Adds a list of collinear points to the Line instance """# -- YOUR CODE HERE --2425def remove_point(self, points):" Removes a list of points from the Line instance """3637# -- YOUR CODE HERE --3839404142434445464748495051525354555657585960616263if== "main":nameTist_points = []n = int(input())for x in range(n):input_line = input().split(',')# -- YOUR CODE HERE# Instantiate a Line using the first two input pointsmyLine =# If your methods are defined correctly, the following lines should#produce the desired output in the test cases.print("Instatiating a Line: ")print(myLine)myLine.add_points(list_points[2:-1])print("Adding More Points: ")print(myLine)myLine.add_points(list_points)print("Adding Redundant Points: ")print(myLine)print("Trying to Remove Last Input Point:")myLine.remove_points([list_points[-1]])print(myLine)print("Trying to Remove All Points:")myLine.remove_points(list_points)print(myLine)64 In the code template below, you are given two classes: Point, which represents to a point in 2D space, and Line,which represents a set of collinear points.To get the distance between two points, we just use the Euclidean distance formula for 2D:d = V(22 - 21)² + (y2 – Y1)²The slope of a line given two points (x1.yı) and (x.y:) , is given by this formula:Y2 - Y1m =x2 - x1To check if a point (x1.y1) lies in a line with slope m, we can just use the slope-intercept form given by:y – Yı = m(x – x1)The first two Point objects in the points attribute of a Line instance would dictate its slope and intercept.Afterwards, an instance of your Line class should be able to add collinear points to points.You cannot remove the first two points in the points attribute of a Line instance. This is to retain its slope andintercept.Your tasks are:a. To complete the other methods in the Point and Line classes.b. To create instances of the Point class and create an instance of the Line class whose points contain areinstances of the Point class that are collinear with each other.Input FormatThe first line contains an integer n, the number of lines to follow.The next n lines contain the 2D coordinate values of each point, with the following format:,ConstraintsFor simplicity, assume that all x and y values in Point objects are integers.Assume that there would be no inputs that would result to lines with an infinite slope.Assume that the input number n will always be greater than 2.Output FormatWe can override the_str_method in the Point class such that it retums the 2D coordinates in the format:(х.у).We can override the_str_method in the Line class such that it retums a string containing all the collinearpoints in the line.Sample Input:e, e|1, 13, -3Sample Output:Instatiating a Line:[(0, 0), (1, 1)]Adding More Points:((0, 0), (1, 1)]Adding Redundant Points:[(0, 0), (1, 1)]Trying to Remove Last Input Point:[(6, 6), (1, 1)]Trying to Remove All Points:[(6, ē), (1, 1)]

Question

Code Template:class Point:def _init_(self, x, y):self.x = xself.y = ydef_str_(self):&#34; Returns a string showing the coordinates with the format (x,y) &#34;--# -- YOUR CODE HERE --def_eq__(self, other):&#34; Checks if two points pertain to the same coordinates &#34;&#34;# -- YOUR CODE HERE --def get_distance(self, other):&#34; Calculates the distance between two points &#34;&#34;&#34;# -- YOUR CODE HERE .-class Line:def _init_(self, point_a, point_b):self.points = (point_a, point_b]def_str_(self):&#34; Returns a string containing all collinear points in the Line instance &#34;&#34;# -- YOUR CODE HERE --def get_slope_intercept(self):Calculates the slope of the line &#34;&#34;&#34;# -- YOUR CODE HERE --def add_point(self, points):&#34;u&#34; Adds a list of collinear points to the Line instance &#34;&#34;&#34;# -- YOUR CODE HERE --2425def remove_point(self, points):&#34; Removes a list of points from the Line instance &#34;&#34;&#34;3637# -- YOUR CODE HERE --3839404142434445464748495051525354555657585960616263if== &#34;main&#34;:nameTist_points = []n = int(input())for x in range(n):input_line = input().split(',')# -- YOUR CODE HERE# Instantiate a Line using the first two input pointsmyLine =# If your methods are defined correctly, the following lines should#produce the desired output in the test cases.print(&#34;Instatiating a Line: &#34;)print(myLine)myLine.add_points(list_points[2:-1])print(&#34;Adding More Points: &#34;)print(myLine)myLine.add_points(list_points)print(&#34;Adding Redundant Points: &#34;)print(myLine)print(&#34;Trying to Remove Last Input Point:&#34;)myLine.remove_points([list_points[-1]])print(myLine)print(&#34;Trying to Remove All Points:&#34;)myLine.remove_points(list_points)print(myLine)64 In the code template below, you are given two classes: Point, which represents to a point in 2D space, and Line,which represents a set of collinear points.To get the distance between two points, we just use the Euclidean distance formula for 2D:d = V(22 - 21)² + (y2 – Y1)²The slope of a line given two points (x1.yı) and (x.y:) , is given by this formula:Y2 - Y1m =x2 - x1To check if a point (x1.y1) lies in a line with slope m, we can just use the slope-intercept form given by:y – Yı = m(x – x1)The first two Point objects in the points attribute of a Line instance would dictate its slope and intercept.Afterwards, an instance of your Line class should be able to add collinear points to points.You cannot remove the first two points in the points attribute of a Line instance. This is to retain its slope andintercept.Your tasks are:a. To complete the other methods in the Point and Line classes.b. To create instances of the Point class and create an instance of the Line class whose points contain areinstances of the Point class that are collinear with each other.Input FormatThe first line contains an integer n, the number of lines to follow.The next n lines contain the 2D coordinate values of each point, with the following format:,ConstraintsFor simplicity, assume that all x and y values in Point objects are integers.Assume that there would be no inputs that would result to lines with an infinite slope.Assume that the input number n will always be greater than 2.Output FormatWe can override the_str_method in the Point class such that it retums the 2D coordinates in the format:(х.у).We can override the_str_method in the Line class such that it retums a string containing all the collinearpoints in the line.Sample Input:e, e|1, 13, -3Sample Output:Instatiating a Line:[(0, 0), (1, 1)]Adding More Points:((0, 0), (1, 1)]Adding Redundant Points:[(0, 0), (1, 1)]Trying to Remove Last Input Point:[(6, 6), (1, 1)]Trying to Remove All Points:[(6, ē), (1, 1)]

Accepted Answer

Solution: 
 
The code for above question is given here.