Need with this question the graph on the right is a possible efficient network to the graph on the left. question 4 options: true. all vertices are connected by the least amount of edges. false. vertex 1 and 2 are not connected. false. vertex 3 and 4 are not connected. true. you can get to vertex 1 from vertex 4 by going through vertex 3.

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

282 6/7 cm^2

step-by-step explanation:

2

step-by-step explanation: