Part 2:
Using the specifications presented in class, implement a Stack ADT and Queue ADT by encapsulating the List ADT. You may use either the the List ADT provided for question 1 or the one you developed; however, be aware of the limitations imposed on stack depth/queue length by a contiguous implementation.
Write a QueueMenu and StackMenu program to test your implementation and demonstrate their operation (feel free to use the ListMenu.c program from assignment 1 as a starting point).
Part 3:
# Write a utility to test for properly nested parentheses in an expression using the Stack ADT.NOTE: you will receive a bonus mark for using your implementation of the list rather than the one provided.