This is the source code for Queues, but it has so many errors. Please update this without errors and warnings.template<class T>int queue <T>::isDecreasing() const{ if (size() < 2) return true; cout << "test" << endl; for (size_t i = 0; i < size() - 1; i++) { cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv " << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl; if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity]) return false; } return true;}template<class T>size_t queue<T>::count(const T& data) const;{ size_t counter = 0; for (size_t i = 0; i < size(); i++) { cout << i << ":" << elements[(_front + i) % _capacity] << endl; if (elements[(_front + i) % _capacity] == data) counter++; } return counter;}And the output must be like this # Working with Queues## 1. Create a method on the Queue class that calculates the number of times a given value occurs in the queue.### Method Declaration:```cppint Queue::count( const T & data ) const;```### Example: `count(...)` function#### Table Explanation:| Result | Queue ||-----------|-----------------------------------|| count(5) | 3 || Queue | front->(1)(1)(5)(3)(5)(5)(2)<-back|| Result | Queue ||-----------|-----------------------------------|| count(10) | 0 || Queue | front->(1)(1)(5)(3)(5)(5)(2)<-back|## 2. Create a method on the Queue class that determines whether the queue is in descending order.### Method Declaration:```cppbool Queue::isDecreasing( ) const;```### Example: `isDecreasing()` function#### Table Explanation:| Result | Queue ||-----------|-----------------------------------|| count(5) | true || Queue | front->(10)(9)(8)(7)(1)<-back || Result | Queue ||-----------|-----------------------------------|| count(10) | false || Queue | front->(1)(1)(5)(3)(5)(5)(2)<-back|

Answered: Working with Queues 1. Create a method…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

This is the source code for Queues, but it has so many errors. Please update this without errors and warnings.

template<class T>
int queue <T>::isDecreasing() const
{
if (size() < 2) return true;
cout << "test" << endl;

   for (size_t i = 0; i < size() - 1; i++)
   {
       cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv "
           << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl;

       if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity])
           return false;
   }
   return true;
}

template<class T>
size_t queue<T>::count(const T& data) const;
{
   size_t counter = 0;
   for (size_t i = 0; i < size(); i++)
   {
       cout << i << ":" << elements[(_front + i) % _capacity] << endl;
       if (elements[(_front + i) % _capacity] == data) counter++;

}
return counter;
}

And the output must be like this