5. (2pts) Convert the function from question 3 into a function that solves the same problem using iteration. 3. (3pts) Convert the following head recursive function into a function that solves the same problem using tail recursion. The new function may have added parameters. int get Sum (Stack stack) { if (stack.isEmpty()) { return 0; } else { int value = stack.pop(); return get Sum (stack) + value; }