Answer:8 pounds to make 20 apple pies
Step-by-step explanation:
66. Δy = -3.4 Δx
Δy/Δx = -3.4
The slope of the line is -3.4. Slope-intercept equation of the line is:
y = -3.4x + b
Plug in the given point to find b:
2 = -3.4(4) + b
b = 15.6
Therefore, the equation is y = -3.4x + 15.6.
Use the equation to find the y coordinates.
![\left[\begin{array}{cc}x&y\\-4&29.2\\4&2\\6&-4.8\\18&-45.6\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7Dx%26y%5C%5C-4%2629.2%5C%5C4%262%5C%5C6%26-4.8%5C%5C18%26-45.6%5Cend%7Barray%7D%5Cright%5D)
68. Repeat the same steps as 66.
Δy = -1.7 Δx
Δy/Δx = -1.7
The slope of the line is -1.7. Slope-intercept equation of the line is:
y = -1.7x + b
Plug in the given point to find b:
3 = -1.7(-7) + b
b = -8.9
Therefore, the equation is y = -1.7x − 8.9.
Use the equation to find the x or y coordinates.
![\left[\begin{array}{cc}x&y\\-19&23.4\\-7&3\\-2.412&-4.8\\3.2&-14.34\\9.1&-24.37\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7Dx%26y%5C%5C-19%2623.4%5C%5C-7%263%5C%5C-2.412%26-4.8%5C%5C3.2%26-14.34%5C%5C9.1%26-24.37%5Cend%7Barray%7D%5Cright%5D)
We will investigate how to determine Hamilton paths and circuits
Hamilton path: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex can be different.
Hamilton circuit: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex must be the same!
As the starting point we can choose any of the points. We will choose point ( F ) and trace a path as follows:

The above path covers all the vertices/points with the starting and ending point/vertex to be ( F ). Such a path is called a Hamilton circuit per definition.
We will choose a different point now. Lets choose ( E ) as our starting point and trace the path as follows:

The above path covers all the vertices/points with the starting and ending point/vertex are different with be ( E ) and ( C ), respectively. Such a path is called a Hamilton path per definition.
One more thing to note is that all Hamilton circuits can be converted into a Hamilton path like follows:

The above path is a hamilton path that can be formed from the Hamilton circuit example.
But its not necessary for all Hamilton paths to form a Hamilton circuit! Unfortunately, this is not the case in the network given. Every point is in a closed loop i.e there is no loose end/vertex that is not connected by any other vertex.
Answer:
4/9 is the answer
Step-by-step explanation:
trust me it's correct