Question 19 1 Point Using the Sorted Edges Algorithm, find the lowest weight of a Hamiltonian circuit. . .. 205 500 E. 340- B 165 360 302 305 185 200 D 320 C Answer = Blank 1 Blank 1 Add your answerQuestion 20 1 Point Using the Nearest Neighbor Algorithm, find the lowest weight of a Hamiltonian circuit starting at vertex A. A ... 205 500 E . -340- B 165 360 302 305 185 200 D 320 C Answer = Blank 1 Blank 1 Add your answerQuestion 21 What is the sum of the shortest path from vertex F to vertex D? Answer = Blank 1 .0. Blank 1 Add your answer Question 22 What is the sum of the shortest path from vertex A to vertex G? Answer = Blank 1 .0. Blank 1 Add your