In the grаph belоw, find the оptimаl tоur for the trаvelling salesmen problem. Then compute it's weight. Find the order of vertices in the optimal tour starting and ending at A (three of the vertices are already filled in): Enter just the single letter representing the vertex in each part, no space or punctuation. First vertex: A Second vertex: B Third vertex: [C] Fourth vertex: [D] Fifth vertex: A