no need explanation just answer the following question.

Question 40 2.5 pts The brute-force algorithm for solving the Traveling Salesman Problem is O A. an optimal and efficient algorithm B. an optimal and inefficient algorithm. O C. an approximate and efficient algorithm. No new data to save. Last checked at 1:08pm Submit Question 39 2.5 pts In dynamic programming technique, the value of the optimal solution is computed in an) fashion A. bottom-up B. top-down O C. greedy Question 38 2.5 pts Which of the following is the shortest path from V2 to vs? O A.V2, v1, v5 O B.V2, v4.5 O C.V2, V3, v4, v5 Question 37 2.5 pts A path in a graph is simple if it never passes through the same vertex twice. True O False Question 36 2.5 pts An acyclic graph is a graph containing one or more cycles. True False