<prompt> Tengeneza programu ya C inayotumia programu inayobadilika kutatua tatizo la muuzaji anayesafiri na seti fulani ya miji na umbali.PLINFORMAT  <response>: cpppamoja na pamoja na pamoja na jumuisha int tspint pos, int alitembelea, const std::vector dist, std::unordered_map memo ikiwa alitembelea 1 dist.size - 1 rudisha distpos0; ikiwa memo.findpos ! memo.end memopos.findalitembelea ! memopos.end rudisha memoposalitembelea; int min_dist std::numeric_limits::max; kwa int i 0; i dist.size; i ikiwa !alitembelea 1 i int new_visited alitembelea 1 i; int cur_dist distposi tspi, new_visited, dist, memo; min_dist std::minmin_dist, cur_dist; memoposalitembelea min_dist; kurudi min_dist;int main int n; std::cin n; std::vector distn, std::vectorn; kwa int i 0; i distij; std::unordered_map memo; int shortest_distance tsp0, 1, dist, memo; std::cout Umbali mfupi zaidi: shortest_distance std::endl; kurudi 0; 