Data Structures for Stacks

Write a program that will implement an ascending sort of data using Stack and Queue containers and only the methods (push, pop, add, remove, etc.) available to the container. (That is, DO NOT USE separate array access or function algorithms to perform the sort on the container.) Each piece of data will be consist of a single word that must be obtained from the user using the standard input device (cin) and initially stored in an instance of either a stack or queue container. Using the appropriate push, pop, etc. methods available to the container move the data between other instances of containers to effect an ascending sort of the data. Whatever containers are chosen, the end result of extracting the data from the container shall result in the values being displayed on the standard output device (cout) in ascending order. When displaying instructions or other non-data information use the standard error device (cerr) and not the standard output device (cout). Use the containers, stack or queue, defined in the Standard Template Library and described on pages 299 through 301 of the text book. Submit the completed / working code in electronic format (a CPP file on floppy disk or attached to an e-mail). For submission by e-mail please use a subject line of HOMEWORK CTXXXX where XXXX is your class number. Also including an added display of your ability have the sort work regardless of the case of the letters contained in each piece of data. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform Needs to be Completed in VB in the Windows Environment