Create 3.6

Q: write a program to sort a stack in ascending order(with biggest items on top). You may use additional stacks to hold items, but you may not copy the elements into any other data structure(such as an array). The stack supports the forllowing operations: push, pop, peek and isEmpty. A: Two stacks. sort original one by inserting each element from original in order into sorted one.