Question $2$ of $5$

What is a fundamental characteristic of the brute$-$force approach in algorithm design?

It is primarily used for graph traversal problems.

It generally requires recursive function calls.

It is applicable only to numerical problems.

It involves straightforward solving based on problem statements and definitions.

firy

It always provides the most optimized solution.