This is the source code for Stacks, but it has errors. Please update this without errors and warnings. And please provide the main function. template bool Stack::isConsecutive(const T & data) const { size_t p = _top - 2; cout<<(p+1>0)< 0; i--) { cout << elements[i]<<" "< void Stack::reverse() { T* temp = new T[_capacity]; size_t tail = _top; for (size_t i = 0; i < tail; ++i) { cout<

C++ Hello im trying to make a list for my code but i cant use the <list> library, how would i make a list for my linked list array based hashtable code wordlist: incase you want to test the entire code a aaa hello goodbye   #pragma once //hashtable.h #include <iostream> #include <string> #include <list> #include <cstdlib> #include "word.h" using namespace std;   class HashTable { int BUCKET; list<Word>* table; public: HashTable(int W);   //to check if the table is empty bool isEmpty() const;   //to insert a key into the hashtable void insertItem(string& x);   //to delete a key from the hashtable void deleteItem(int key);   int hashFunction(Word x);   //to look for the key in the table bool searchTable(string& key); void displayHash();   }; //hashtable.cpp #include "hashtable.h" #include <iostream> HashTable::HashTable(int W) { table = new list < Word >[W]; BUCKET = W; return; }   //to check if the table is empty bool…

stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).