What is a common characteristic of problems suitable for dynamic programming, as illustrated by the cooking times optimization?

Group of answer choices

They involve finding the shortest path in a graph.

They have overlapping subproblems and optimal substructure.

They require sorting and searching algorithms.

They can be solved using a single loop iteration.