no need explanation just answer the following question.

Question 35 2.5 pts The travelling salesman problem can be solved in: O A. Polynomial time using brute-force algorithm O B. Polynomial time using recursive algorithm C.Exponential time using dynamic programming algorithm D Question 34 2.5 pts A Hamilton circuit (tour) in a directed graph is a path from a vertex to itself that passes through each of the other vertices exactly once. Which of the following is a Hamilton circuit of the graph? 9 4 O A.V2.V3, V4.VS.V1.27 O B.V1. 14, V2 V3, V4, V1 OC. VI. V2 V3, V4, VS Question 33 2.5 pts What is the weight of edge (V4. 3)? 9 2 O A4 B2 O C. Infinity Question 32 2.5 pts What procedure is being followed in Floyd's Algorithm for Shortest Path? A. Bottom up B. Top down O C. Big bang Question 31 2.5 pts What approach is being followed in Floyd's Algorithm? A Divide and Conquer B. Dynamic Programming OC. Greedy technique