A computing problem is amenable to be solved by a recursive algorithm when:
A.
The problem has a “self-similar” nature, i.e., the nature of a smaller instance of the problem is the same as the original one
B.
The problem has an “data-parallel” nature, i.e., the problem can be divided into many parts that can be solved totally independently
C.
The problem has a “function-parallel” nature, i.e., an exact same operation can be applied to different parts of the problem simultaneously
D.
None of the options given