The Following Algorithm Is an Example of ____

The following algorithm is an example of ____.
Begin with an equilateral triangle
Sierpinski (triangle)
Start
Find the midpoint of each side of the triangle
Draw lines connecting the midpoints, which will form four smaller triangles that can be called triangles A, B, C, and D, with D in the center and the others around it.
Color in (or cut out) the center triangle // triangle D
Do Sierpinski (triangle A)
Do Sierpinski (triangle B)
Do Sierpinski (triangle C)
Stop

A) linear recursion
B) iteration
C) mutual recursion
D) infinite recursion