c++ program of a telephone system using stacks and queues to hold the calls

I need a program to represent a telephone system with automatic redial feature. System can store 5 most recent calls. Once the limit of 5 is reached and another call is made the least recent number is deleted to make room for the new number--use a circular queue. User can choose to review calls,review old calls or exit. New calls are reviewed by starting with most recent caller. Old calls are reviewed with the first call on the queue holding old calls. When reviewing calls user may call back the caller, ignore the caller, call back later putting number back on queue for later. Use the following data structures in program: [login to view URL] to hold numbers of incoming new calls-new calls queue [login to view URL] the numbers from the new calls queue to a stack in order to set up for reviewing the calls [login to view URL] another queue of size 5 to hold the numbers that the user wishes to wait to call-old calls queue. The program should be menu driven Read the numbers from an input file to simulate incoming calls A phone number leaves the system if the user calls back or ignores the caller When the user reviews old calls, the numbers are taken from the old calls queue directly without using the stack. The stack is used when reviewing calls from the new calls queue. Run program for just one time period ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform unix operating system....cxx compiler ## Deadline information Must be turned in by midnight Tue June 4,2002