a policeman has to patrol along the streets of the subdivision represented by the following graph. he wants to start his trip at the police station (located at x) and end the trip at his home (located at e). he needs to cover each block of the subdivision at least once and at the same time he wants to duplicate the fewest possible number of blocks. find an optimal eulerization of the graph (add the fewest number of edges to have the desired euler path.

step-by-step explanation:

most likely the answer is a.

alice wins if a total of 5 is rolled. finn wins if a total of 9 is rolled.

step-by-step explanation:

is their an equation anywhere i can take a   look at it and see if i am right.

step-by-step explanation:

consider the parallelogram shown in the attached image.

in the parallelogram hijk, the length of hk is given as,

from the properties of parallelogram we know that the opposite sides of a parallelogram are parallel to each other and are equal in measure.

therefore, the length of the side ij must be equal to the length of the side hk and that is .

hence, the expression for the length of ij confirms that hijk is a parallelogram.