Write a C++ program to implement Queue ADT using singly linked structure. The program includes the following Define the Queue class template in the header file QueueLinked.h. // QueueLinked.h #ifndef QUEUE-H #define QUEUE. H #includeiostream> using namespace std; template class Queue public: // Constructor Queue (); //Desctructor Queue) // Makes the queue to the empty state void make_empty); /I Checks if the queue is empty bool empty() const; / Inserts item at the end of the queue void enqueue(const T& item) // Removes the element at the start of the queue void dequeue); // returns the front element const T& front_element() const; // Prints the elements of the queue void print() const private: struct NodeType T data; NodeType* next NodoTypo noxt NodeType(const T & d = T()): data(d) next nullptr; 1i NodeType* front; NodeTypc back; #endif Please read the comments carefully and implement the Queue class template You can implement the Queue class template in the seperate file QueueLinked.cpp. QucueLinked.cpp #include "QueueLinked.h" template QucuaKT>::Qucue) front nullptr; back = nullptr; add other monber functians You also can put the implementation of the Stack class template in stack.h QueueLinked.h tifndef QUEUE_H #define QUEUE-H #include class CueLuP template class Queue public: l/ Constructor Queue) front nullptr; back nullptr; // dd other member functions private: struct NodeType T data; NodeType next; Nodelype(const T & d T0): data(d) next nullptr; di NodeType front; NodeType back; #endi f . The main function is contained in the file labas.rpp. labo5.cpp tinclude include "QueueLinked.h include "QueueLinked.cpp. // edd f the interface and implementation ar seperate int nain) Write a C++ program to implement Queue ADT using singly linked structure. The program includes the following Define the Queue class template in the header file QueueLinked.h. // QueueLinked.h #ifndef QUEUE-H #define QUEUE. H #includeiostream> using namespace std; template class Queue public: // Constructor Queue (); //Desctructor Queue) // Makes the queue to the empty state void make_empty); /I Checks if the queue is empty bool empty() const; / Inserts item at the end of the queue void enqueue(const T& item) // Removes the element at the start of the queue void dequeue); // returns the front element const T& front_element() const; // Prints the elements of the queue void print() const private: struct NodeType T data; NodeType* next NodoTypo noxt NodeType(const T & d = T()): data(d) next nullptr; 1i NodeType* front; NodeTypc back; #endif Please read the comments carefully and implement the Queue class template You can implement the Queue class template in the seperate file QueueLinked.cpp. QucueLinked.cpp #include "QueueLinked.h" template QucuaKT>::Qucue) front nullptr; back = nullptr; add other monber functians You also can put the implementation of the Stack class template in stack.h QueueLinked.h tifndef QUEUE_H #define QUEUE-H #include class CueLuP template class Queue public: l/ Constructor Queue) front nullptr; back nullptr; // dd other member functions private: struct NodeType T data; NodeType next; Nodelype(const T & d T0): data(d) next nullptr; di NodeType front; NodeType back; #endi f . The main function is contained in the file labas.rpp. labo5.cpp tinclude include "QueueLinked.h include "QueueLinked.cpp. // edd f the interface and implementation ar seperate int nain)