I applied the Gauss-Jordan Algorithm to four Dependent systems of 3-D planes and ended with the following matrices. In each case depict a General Form for the infinitely many points of intersection and determine any three points of intersection

step-by-step explanation:

always plug in x. in this case, x equals 4.

i'm going to first solve 4(2+3x)

1) 4(2+3(4)) use pemdas to solve.

i'm going to multiply whats in the parenthesis first, so 3 times 4=12.

2)4 (2+12) i'm then going to multiply 4 by both numbers in the parenthesis (because multiplying comes before adding)

4 times 2= 8.   4 times 12= 48

4) (8+48)= 56 (answer)

i'm then going to solve 8+12x and plug in 4 for x.

1) 8 +12(4)

multiplying comes before adding, so i'm gonna multiply 12 and 4.

12 times 4= 48.

2) 8+48=56

both equal the same!

we have the parent function given by,

1. the function is translated 5 units to the left.

so, we get,   becomes

2. the function is translated 5 units to the right.

so, we get,   becomes

3. the function is translated 5 units upwards.

so, we get,   becomes

4. the function is translated 5 units downwards.

so, we get,   becomes

5. the function is reflected across x-axis.

so, we get,   becomes

6. the function is reflected across y-axis.

so, we get,   becomes .

step-by-step explanation:

mark brainliest.

hope this is what you were asking for!

step-by-step explanation: