1 Implement The Stack Adt As Described In Section 11 1 In A C B Ada C Ml 2 A Double 2110573

1. Implement the Stack ADT as described in Section 11.1 in (a) C; (b) Ada; (c) ML.

2. A double-ended queue, or deque, is a data type that combines the actions of a stack and a queue. Write an algebraic specification for a deque abstract data type assuming the following operations: create, empty, front, rear, addfront, addrear, deletefront, and deleterear.