Problem
1. Write a constructor for file Linked_Stack.tc that loads the stack from an iterator range. The last element in the range should be at the top of the stack.
2. Write a client that removes all negative numbers from a stack of int objects. If the original stack contained the integers 30, -15, 20, -25 (top of stack), the new stack should contain the integers 30, 20.