(Solved): write a code in c++ Write a C Program to get a graph, a proposed candidate solution (i.e., a of set ...

Write a C Program to get a graph, a proposed candidate solution (i.e., a of set vertices which mark the cities a traveling salesman has to visit, and check whether it covers the possible route to visit each city exactly once and return to the origin city) from the User. Output true if the given candidate solution is actually a possible route. Else, output the given candidate solution is not actually a solution. What is the time complexity of your program? For example, for the following graph and the possible route $$A??B?>C?D?>A$$, the algorithm should return true. $$\text{ Cost Adjacency matrix of the above graph }=\left(\begin{array}{cccc}0& 25& 10& 15\\ 25& 0& 10& 45\\ 10& 10& 0& 5\\ 15& 45& 5& 0\end{array}\right)$$ For example: