True or false a. All algorithms can be stated recursively. b. Some algorithms can only be stated recursively. c. For most people, recursive algorithms are more difficult to discover and understand than non-recursive algorithms. d . All recursive algorithms must have an escape clause. e . Recursive algorithms , if not properly coded, can terminate with a stack overflow error; if true , why ?