(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 , y4). Write a program that prompts the user to enter these four endpoints and displays the intersecting point. Use the LinearEquation class in Exercise for finding the interesting point. See Programming Exercise for sample runs.
(Geometry: int ersecting point) Two point s on line 1 are given as (x1 , y1) and (x2 , y2) and on line 2 as (x3 , y3) and (x4 , y4), as shown in Figurea–b.



Figure Two lines int ersect in (a and b) and two lines are parallel in (c).
The int ersecting point of the two lines can be found by solving the following linear equation:

This linear equation can be solved using Cramer’s rule (see Programming Exercise). If the equation has no solutions, the two lines are parallel (Figurec). Write a program that prompts the user to enter four point s and displays the int ersecting point. Here are some sample runs:


(Algebra: solve 2 × 2 linear equations) You can use Cramer’s rule to solve the following 2 × 2 system of linear equation:
![]()
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.”


(Algebra: solve 2 × 2 linear equations) You can use Cramer’s rule to solve the following 2 × 2 system of linear equation:
![]()
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.”


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.