Provide the Mystack.h and Myqueue.h in different steps,

  

Stacks and queues are important data structures in the fields of digital design and computer architecture. Your task is to write two template classes for managing generic stacks and queues, based on the following requirements: Create and submit the files MyStack.h and MyQueue.h (remember that .cpp files are not allowed when defining templates). Ensure that the MyStack and MyQueue classes work properly with the int, float, and char datatypes. The maximum size of the stack or queue shall be hardcoded as 10. Each class should provide the following public member functions: o default constructor o peek: non-destructively returns the value on top of the stack or at the front of the queue. An exception handler should return an arbitrary value and print an error message if the container is empty. pop: remove one element from container and return it push: insert new element into container o clear: delete all entries from container o size: number of elements in container o full: returns true if the container is full o empty: returns true if the container is empty Overflow and underflow must be handled via exceptions. The grader will compile your classes with a main.cpp file to grade functionality. This main.cpp file: #include #include #include "MyStack.h" #include "MyQueue.h" using namespace std; int main() { MyStack 31; MyQueue ql; int i; cout < < "Filling stack and queue." < < endl; for (i=0; i