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.