A tail-recursive function often can be rewritten iteratively using a _______. 

A tail-recursive function has its recursive call as the last action, which means the function doesn't need to hold onto its context or any other state between recursive calls. This nature allows it to be easily translated into an iterative structure, primarily using loops.