Just need the answers to 5 and 6. Convert the recursive code from 3 into an itteraive solution.

(3pts) Convert the following head recursive code into tail recursion: int Getsum (IStack stack) 3. if (stack.isEmpty()) return 0 else f int value stack.pop () return GetSum (stack) + value; 4. (3pts) Convert the following tail recursive code into head recursion: int GetProduct (IQueue queue, int product) ( if (queue.isEmpty()) ( return product else ( int value queue. dequeue () return Get Product (queue, product value) (2pts) Convert the recursive code from question 3 into an iterative s 6. (2pts) Convert the recursive code from question 4 into an iterative solution