Sophia is collecting stickers for the 2026 World Cup album. To complete her collection, she plans to leave home (V0), visit all the sticker exchange points (V1, V2, V3, V4) in the city of Campinas exactly once, and then return home. The figure below shows a weighted adjacency matrix of an undirected graph. V0 V1 V2 V3 V4 V0 0 14 16 0 0 V1 14 0 11 12 14 V2 16 11 0 14 17 V3 0 12 14 0 15 V4 0 14 17 15 0 each vertex (V) represents a sticker exchange point; each link represents the possibility of traveling between two points; the weight of each edge represents the amount Sophia will spend in R$ when taking that route; there is only a connection between two vertices when the weight shown in the matrix is greater than zero. Considering this information, help Sophia choose a route where she visits all the sticker exchange points exactly once, returns home, and has the lowest possible total cost. To help with this question, you can use the draft below: What is the minimum...