Name: date: 2/22/2018 CSC254_Q2_Spring2018 Stack Recursive True/False Indicate whether the statement is true or 1 The 2. A function that calls itself is an it 3. Every recursive call has its own code. 4. A stack is a list of eler e recursive algorithm must have three or more base cases. e function. nogenous elements in which the addition and deletion of elem Multiple Coccurs only at one end. dentify the choice that best completes the statement or answers the question 5. The addition and deletion of elements occurs only at one end of a stack, called the stack a. head b. top c. bottom d. tail heoperation checks whether the stack is full. a. isEmpty b. peek . pop d. isFullStack 7 The a. isFullstack b. isEmptyStack u115s opsration checks whether the stack is empty c. peek d. pop 8. The operationreinitializes the stack to an empty state. a. alloc b. init 9. What is the output of this program? #include using namespace std int main) char str(S)ABC" cout