1. Give a step-by-step description of an algorithm for solving the Chinese postman problem on an arbitrary graph (not multigraph). If necessary, you can refer to some algorithms that are considered in the lecture notes without giving their detailed description. 2. Apply your algorithm to solve the Chinese postman problem on the following graph. Describe the optimal postman's tour and the total distance travelled by the postman on this tour. 3. For a graph with n vertices of arbitrary degree, how can we estimate the worst-case complexity of this algorithm? Which step has the largest complexity? a 15 10 b 13 19 18