(Solution of the Directed Chinese Postman Problem) Consider expanding the graph of the directed Chinese postman problem by duplicating arcs so that the number of incoming arcs to each node is equal to the number of its outgoing arcs. A forward Euler cycle of the expanded graph corresponds to a solution of the directed Chinese postman problem. Show that the optimal expanded graph is obtained by minimizing