Which of the following can traverse the state space tree only in DFS manner?

• A. branch and bound
• B. dynamic programming
• C. greedy algorithm
• D. backtracking