6. (2pts) Convert the function from question 4 into a function that solves the same problem using iteration. 4. (3pts) Convert the following tail recursive function into a function that solves the same problem using head recursion. The new function may have less parameters. int get Product (Queue queue, int product) { if (queue.isEmpty()) { return product; } else { int value queue. dequeue (); return get Product (queue, product * value); } }