Assume that language SL includes a stack data structure andthree operations: NewTop(S,E) which adds the element E to the topstack S, popTop(S), which deletes the top element of the stack S,GetTop(S) which returns a pointer to the location in stack S of thecurrent top element. What is wrong with the design of these threeoperations? How could they be redefined to correct the problem?
Expert Answer
An answer will be send to you shortly. . . . .