[solved]-True False Dynamic Programming Algorithm Uses N X N Table Running Time Always O N 2 True Q39021319

TRUE or FALSE: If a dynamic programming algorithm uses an n x ntable then the running time is always O(n^2).

TRUE or FALSE: The running time of a dynamic programmingalgorithm used to solve a problem is always polynomial in the inputsize of the problem.

Please explain both. Thank you!

Expert Answer

---

Answer to TRUE or FALSE: If a dynamic programming algorithm uses an n x n table then the running time is always O(n^2). TRUE or FA… . . .