Alex needs a program to determine which of the two points is closer to the origin and to identify the orientation of the line segment connecting these two points. The orientation is determined based on the coordinates of the two points. The program should:Calculate the distance of each point from the origin (0, 0).Determine which point is closer to the origin.Identify the orientation of the line segment between the two points based on their coordinates:Vertical: If the x-coordinates of both points are the same.Horizontal: If the y-coordinates of both points are the same.Oblique: If neither the x-coordinates nor the y-coordinates of the two points are the same.Assist Alex in the program.Company Tags: CapgeminiInput format :The input consists of four integers representing the coordinates of the two points:x1 and y1 for the first point.x2 and y2 for the second point.Output format :The first line of output prints a double value, representing the distance of the closer point to the origin, formatted to one decimal place.The second line prints the orientation of the line segment connecting the two points.

Consider the conditions under which two line segments intersect. Think about how you can use the given coordinates to determine if the line segments intersect or not. Pay close attention to the orientation of the line segments.

public static void DrawLine(Graphics g, int x1, int y1, int x2, int y2) { // Calculate the absolute difference between x-coordinates and y-coordinates int dx = Math.Abs(x2 - x1); int dy = Math.Abs(y2 - y1); // Initialize error and increment variables int error = 0; int incr = dx > dy ? dy : dx; // Determine the direction of the line int stepX = x2 > x1 ? 1 : -1; int stepY = y2 > y1 ? 1 : -1; // Draw the line using Bresenham's algorithm for (int x = x1, y = y1; x != x2 + stepX; x += stepX) { g.SetPixel(x, y, Color.Black); error += incr; if (error >= dy) { y += stepY; error -= dy; } } }

the straight line distance between 2 points

Bresanham circle algorithm uses the approach ofMidpointPointLineNone of theseView answer

Problem StatementEva is at (3, 4) on a 2D grid, and Angel is at an unknown point (x, y). They want to find the Euclidean distance between them. Write a program taking Angel's coordinates as input and using built-in mathematical functions to output the distance.Formula: distance = sqrt((x - 3)2 + (y-4)2) Note: The program should utilize built-in mathematical functions, pow and sqrt, for accurate calculation of the Euclidean distance.Input format :The input consists of two space-separated integers, x and y, representing the coordinates of Angel's location.Output format :The output displays a single integer representing the Euclidean distance between Eva and Angel.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases will fall under the following constraints:1 ≤ x, y ≤ 1000Sample test cases :Input 1 :5 10Output 1 :6Input 2 :15 3Output 2 :12Input 3 :887 999Output 3 :1330