is it true that any backtracking algorithm can be converted into a DP algorithm in polynomial time?

Question

is it true that any backtracking algorithm can be converted into a DP algorithm in polynomial time?

Also, are all DP problems considered to be solvable in polynomial