A mail carrier has to deliver mail in a small town with 9 streets and 5 intersections (vertices). The table below shows the distances (in miles) between the intersections. The mail carrier must travel each street at least once and return to the starting intersection. Draw the graph, verify which nodes have an odd number of edges and find one optimal path for the mail carrier assuming he starts at A. How many miles in total will the carrier need to walk to cover all 9 roads?