5. Consider a language that does not have arrays but does have stacks defined as a data type. That is, one can declare stack s; The push, pop, empty, and peek operations are defined. Show how a one-dimensional array can be implemented by using these operations on two stacks. In particular, show how you can insert into and read from such an array.