Ah, thank you. your question truly made the most of sense.
Let us consider the image on the left that is the image in which 1 and 2 , 3 and 4 are connected as image 1 and the other as image 2.
1. All Vertices are connected by the least amount of edges. True
2. Vertex 1 and 2 are not connected. This is false for image
1 and true for image 2
3. Vertex 3 and 4 are not connected. This is false for image
1 and true for image 2
4. You can get to Vertex 1 from Vertex 4 by going through Vertex 3. This is true for image 1
Answer:
not completely sure but I think it's it's 13.4
What kind of Question is that. That is some real math right there.
Answer:
D-both a relation and a function
Step-by-step explanation:
