Algorithms that use this concept can be analyzed with the Akra-Bazzi method, which generalizes the three (10[1])different cases of algorithms (10[1])using this concept that (10[1])can be analyzed with the master theorem. (10[7])Many functional (10[1])programming (10[1])languages (10[1]-5[2])like Lisp use this concept’s “tail” (10[4])form (10[1])to (10[1])implement (10[2])iteration. (10[2])This concept is conventionally (10[2])used (10[2])in (10[1])implementations of (10[1])depth-first-search (10[4])and (-5[1])algorithms (10[1])like (-5[1])quicksort (10[2]-5[1])that (10[1]-5[1])are divide-and-conquer. (10[4]-5[2])The (10[2]-5[1])Towers of Hanoi problem can be solved (10[1]-5[1])with this (10[2])programming (-5[1])concept, (10[4])which (10[1])requires defining a base case (-5[1])and a (10[1])namesake step. (10[1])For 10 points, (10[1])name this concept in which (-5[1])a function calls (10[1])itself. (10[3]0[1])■END■ (10[7]0[1])