1.Do the same task as in problem 6.17, but this time use iteration, not recursion. Construct your own stack, and perform pushes and pops as necessary to print out the values in descending order. Use a...

1.Do the same task as in problem 6.17, but this time use iteration, not recursion. Construct your own stack, and perform pushes and pops as necessary to print out the values in descending order. Use a linked structure for your stack. 2. Do the same task as in problem 6.18, but this time use an array to implement your stack. (If you designed your solution to 6.18 with appropriate abstraction, you will be able to create new modules for push, pop, etc., then reuse much of

your solution to 6.18 with minimal modification.)