Q02,viMCQMarks unknownWhich of the following problems is not NP\text{NP}NP-hard?(A)Hamiltonian circuit problem(B)The 0/10/10/1 Knapsack problem(C)Finding bi-connected components of a graph(D)The graph coloring problemSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google