(Geometry: int ersecting Point) Two Points on line 1 are given as (x1 , y1) and (x2 , y2)...

(Geometry: int ersecting Point) Two Points 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 Points and displays the int ersecting Point. Here are some sample runs:

Programming Exercise (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.”