1. Place your compass point on X and measure the distance to point Y. Swing an arc of this size above (or below) the segment.
2. Without changing the span on the compass, place the compass point on Y and swing the same arc, intersecting with the first arc.
3. Label the point of intersection as the third vertex of the equilateral triangle.
4. Use you straight edge and connect the points.
Answer:
D. Logical Fallacies
Step-by-step explanation:
Let's break this down:
fallacy: A false or mistaken idea.
By this definition, we can see that "false" would go with the word "faulty". A logical Fallacy is is a false or mistaken idea that's intended to sound logical. I hope this helps you!!
Answer:
14/3
Step-by-step explanation:
Answer:
39
Step-by-step explanation:
Kruskal's Algorithm has you add edges in order of weight, from least to greatest, excluding edges that form loops, until all nodes are connected.
__
Here, the edges have weights ...
5 -- AD, CE
6 -- DF
7 -- AB, BE
8 -- BC, EF
9 -- BD, EG
11 -- FG
15 -- DE
The edges shown in bold are ones that can be added without creating loops. Their total weight is 5×2 +6 +7×2 +9 = 39.
The weight of the minimum spanning tree is 39.
X = 2/7
steps:
add 5/7 to both sides
