Which statement is true when comparing dynamic programming and brute force?

Dynamic programming evaluates each subproblem each time a program needs that particular subproblem.

All brute force problems can be solved by dynamic programming.

There are some problems where brute force is a better solution.

Brute force techniques employ the concept of memorization of solutions to subproblems.