Answer:
ABCDEADBEC
Step-by-step explanation:
A path that traverses all streets exactly once is called an Euler path. It is only possible for a graph that has an even number of streets coming together at each vertex, or one that has an odd number of streets at only two vertices.
This map has an odd number of streets at vertices A and C, so those are suitable starting and ending points for the path. I find it convenient to travel the outside ring first, then fill in the inner paths that weren't previously traveled. The list of vertices for one possible path is shown above.
Answer:
The correct answer is monthly . -APEX
Step-by-step explanation:
Answer:
9
Step-by-step explanation:
1*3 = 3 and 3*3 = 9
So the answer is 9
Hope this helps!
Answer:
x=150°
Step-by-step explanation:
Using the vertical angle theorem, you can infer that AEC and DEB are in fact the same angle, 20°, and the same goes for FED and CEG, both 130°.
So, x spans AEC and CEG so is 20° + 130° = 150°
