Answer: -21
Step-by-step explanation:
11-32
Answer:
Check the explanation
Step-by-step explanation:
Package wrapping technique can he used to compute convex null of a set Q which was given by Jarvis march
The running time of the algorithm runs in 0(M), where h is the number of vertices of CH (0). The total running time for K convex la, and the I. layer contains li points is.
Kindly check the attached image below to see the step by step explanation to the question above
.
Answer:
Gary bikes farther to get to school
Answer:
A(...; 9)
x = 57/7
B(4; ...)
y = 16/5
m = 7/5
Step-by-step explanation:
7x−5y=12
For point A(...; 9)
We know y = 9
Substitute it in
7x−5(9)=12
7x -45= 12
Add 45 to each side
7x-45+45=12+45
7x = 57
Divide by 7
7x/7 = 57/7
x = 57/7
For point B(4; ...)
We know x=4
Substitute it in
7(4)-5y =12
28 - 5y =12
Subtract 28 from each side
28-28 -5y =12-28
-5y =-16
Divide by -5
-5y/-5 = -16/-5
y = 16/5
Now we need to find the slope by solving the equation for y
7x -5y = 12
Subtract 7x
-5y= -7x +12
Divide by -5
-5y= -7x +12
-5y/-5 = -7x/-5 +12/-5
y = 7/5 x -12/5
This is in the form y = mx +b where m is the slope
m = 7/5
