Which of the following is not a backtracking algorithm?(A) Knight tour problem(B) N queen problem(C) Tower of hanoi(D) M coloring problem