Ada stacks and the time system

[sandeep parajuli <parajulisandeep.sp205168@gmail.com>]

Emperor Constantine has commanded Darth Vader to build and operate a warship repair facility for Tie Fighters and Star Destroyers.  When a damaged vehicle arrives a service record must be placed in the appropriate service bay including the vehicles name and time of arrival.  For security reasons, Tie fighters are assigned names of TieA, TieB etcetera.  Likewise, Star Destroyers are given names of StarA, StarB etcetera.  After a vehicles name ends in ‘Z’ the sequence is repeated from ‘A’.  Lord Vader directed us to write a program for the facility providing support for two stacks or parish in the attempt.  To minimize waste, the two stacks must occupy the same physical space, for example locations 1 through 20 for the “C” Option.  The stack space must be allocated dynamically in the stack, not the heap (Box1.ada)!  You must prompt the user at run time for the upper and lower array bounds.  For the “C” option use 1 and 20 as the lower and upper bounds for the actual space used to track vehicles, i.e., the stack space will hold a maximum of 20 space vehicles.  The following memory model was specified by Lord Vader using 1 and 20 for the lower and upper bounds respectively.

How can we do this is Ada