D Question 1 10 pts 2021-22 Academic Year Home 1. Give a step-by-step description of an algorithm for solving the Chinese postman problem on Announcements 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. Assignments 2. Apply your algorithm to solve the Chinese postman problem on the following graph. Describe Discussions the optimal postman's tour and the total distance travelled by the postman on this tour. ard 3. For a graph with n vertices of arbitrary degree, how can we estimate the worst-case Grades complexity of this algorithm? Which step has the largest complexity? People ses Pages ups Syllabus Quizzes ndar 10 Modules O Eh Collaborations box Reading Lists @ Liverpool listory Course Surveys Stream Lectures Search Zoom LTI Pro 2 18 Studio Search ? Help Upload Choose a file