$A(n)$ is a strategy that guarantees a solution to a problem.

Select one:

a$.$ heuristic

b$.$ fixation

c$.$ algorithm

d$.$ subgoal

$A(n)$ is a strategy that guarantees a solution to a problem.

Select one:

a$.$ heuristic

b$.$ fixation

c$.$ algorithm

d$.$ subgoal

$A(n)$ is a strategy that guarantees a solution to a problem.

Select one:

a$.$ heuristic

b$.$ fixation

c$.$ algorithm

d$.$ subgoal