Answer:

Step-by-step explanation:

We can try to simplify first.

Now we can combine the like terms:

hope this helped! :)
Part A: One solution because the lines intersect one time.
Part B: (3,4) or x=3 and y=4 (depending on how you have to write it)
Answer:
min = a_1
for i:= 2 to n:
if
< min then min = 
return min
Step-by-step explanation:
We call the algorithm "minimum" and a list of natural numbers 
So lets first set the minimum to 
min = a_1
now we want to check all the other numbers.
We can use a simple for loop, to find the minimum
min = a_1
for i:= 2 to n:
if
< min then min = 
return min
Answer:
seven hundred thousand place
Step-by-step explanation: