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

The distance D between two points with coordinates (x1,y1) and (x2,y2) on a plane is given byD = [(x2- x1)2 + (y2 – y1)2]1/2The distance between two points (x1,y1,z1) and (x2,y2,z2) in a three dimensional space is given byD = [(x2-x1)2 +(y2-y1)2 + (z2-z1)2]1/2Develop a program in C++ using function overloading by writing the same function  ComputeDistance() with different signatures. Round off distance to two decimal pointsNote: Syntax to print 'x' decimal places of variable 'a'include <iomanip>usecout<<fixed<<setprecision(x)<<a;Input formatx coordinate of point 1y coordinate of point 1z coordinate of point 1x coordinate of point 2y coordinate of point 2z coordinate of point 2Output formatDistance in two dimensional planeDistance in three dimensional space

A game programmer decides to use the Pythagorean distance formula for collision detection: The programming environment provides these built-in procedures:Name Descriptionsqrt(n) Returns the square root of  .square(n) Returns the value of  .In the programmer's code, the coordinates are represented by the variables x1, y1, x2, y2.Which of these code snippets properly implements the distance formula?Choose 1 answer:Choose 1 answer:(Choice A)   sqrt( square(x2 - x1) + square(y2 - y1) )Asqrt( square(x2 - x1) + square(y2 - y1) )(Choice B)   sqrt() square() (x2 - x1) + square() (y2 - y1) Bsqrt() square() (x2 - x1) + square() (y2 - y1)(Choice C)   sqrt( (x2 - x1)square +(y2 - y1)square )Csqrt( (x2 - x1)square +(y2 - y1)square )(Choice D)   sqrt() * square(x2 - x1) + square(y2 - y1)Dsqrt() * square(x2 - x1) + square(y2 - y1)(Choice E)   sqrt( square(x2) - x1 + square(y2) - y1 )Esqrt( square(x2) - x1 + square(y2) - y1 )

Single File Programming QuestionProblem StatementRohit wanted to teach his new batch of students to find the distance between two points.He wants your help in writing a program to accept two points and calculate the distance between them using pointers. The result should be a float value.Note: d = √((x2 – x1)² + (y2 – y1)²)Input format :The first line of input consists of two space-separated integers x1 and y1, representing the coordinates of Point 1.The second line of input consists of two space-separated integers x2 and y2, representing the coordinates of Point 2.Output format :The output prints a floating-point value - the distance between two points with two decimal places.Refer to the sample output for the formatting specificationsCode constraints :In this scenario, the test cases fall under the following constraints:1 ≤ x,y ≤ 1000Sample test cases :Input 1 :2 34 1Output 1 :2.83Input 2 :4 72 8Output 2 :2.24Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.Marks : 10Negative Marks : 0WhitelistSet 1:*

The distance between points (3, 7) and (x1, y1) is the square root of (x1 - 3)2 + (y1 - 7)2.A.TrueB.False

Given the coordinates of two points in the plane, you can use either the distance formula or the Pythagorean theorem to find the distance between them.A.TrueB.False