(Geometry: intersection) Suppose two line segments intersect. The two endpoints for the first line segment are (x1, y1) and (x2, y2) and for the second line segment are (x3, y3) and (x4, y5). Write the following function that returns the intersecting point if the two lines intersect:
void intersectPoint(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double & x, double & y, bool & isIntersecting)
Write a program that prompts the user to enter these four endpoints and displays the intersecting point. (Hint : Use the function for solving 2 X 2 linear equations in Programming Exercise.)


Programming Exercise (Algebra: solve 2 × 2 linear equations) You can use Cramer’s rule to solve the following 2 × 2 system of linear equations:
![]()
Write a function with the following header:
void so1veEquation(double a, double b, double c, double d, double e, double f, double & x, double & y, bool & isSolvable)
If ad − bc is 0, the equation has no solution and isSolvable should be false. Write a program that prompts the user to enter a, b, c, d, e, and f and displays the result. If ad − bc is 0 , report that “The equation has no solution.” See Programming Exercise for sample runs.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.