I need help debuggine my code so it will pass all the test cases. Please help! $//**********************************$

$//$Write your code below here

$//**********************************$

template

class QueueForCS$2420$ : public BaseQueue $\{$

public:

$//$ TODO: Complete constructor, copy constructor, copy assignment, and destructor, and all other needed methods

QueueForCS$2420($const int capacity$)$;

~QueueForCS$2420()$;

QueueForCS$2420($const QueueForCS$2420$& objToCopy$)$;

const QueueForCS$2420$& operator$=($const QueueForCS$2420$& objToCopy$)$;

void push$\_$back$($const T& data$)$;

void pop$\_$front$()$;

T front$()$ const;

T back$()$ const;

unsigned int size$()$;

private:

$//$ TODO: Supply the $5$ needed data members

T$*$ arr$\{$ nullptr $\}$;

unsigned int capacity$\{0\}$;

unsigned int slots$\{0\}$;

unsigned int head$\{0\}$;

unsigned int tail$\{0\}$;

$\}$;

template

QueueForCS$2420$::QueueForCS$2420($const int capacity$)\{$

$//$ TODO: Complete this

this$->$arr $=$ new T$[$capacity$]$;

this$->$capacity $=$ capacity;

return;

$\}$

template

QueueForCS$2420$::~QueueForCS$2420()\{$

$//$ TODO: Complete this

delete$[]$ this$->$arr;

$\}$

template

QueueForCS$2420$::QueueForCS$2420($const QueueForCS$2420$& objToCopy$)\{$

this$->$capacity $=$ objToCopy.capacity;

this$->$slots $=$ objToCopy.slots;

this$->$head $=$ objToCopy.head;

this$->$tail $=$ objToCopy.tail;

this$->$arr $=$ new T$[$this$->$capacity$]$;

for $($unsigned int i $=0$; i $$ this$->$capacity; $++$i$)\{$

this$->$arr$[$i$]=$ objToCopy.arr$[$i$]$;

$\}$

$\}$

template

const QueueForCS$2420$& QueueForCS$2420$::operator$=($const QueueForCS$2420$& objToCopy$)\{$

if $($this $!=$ &objToCopy$)\{$

if $($this$->$arr $!=$ nullptr$)\{$

delete$[]$ this$->$arr;

$\}$

this$->$capacity $=$ objToCopy.capacity;

this$->$slots $=$ objToCopy.slots;

this$->$head $=$ objToCopy.head;

this$->$tail $=$ objToCopy.tail;

this$->$arr $=$ new T$[$this$->$capacity$]$;

for $($unsigned int i $=0$; i $$ this$->$capacity; $++$i$)\{$

this$->$arr$[$i$]=$ objToCopy.arr$[$i$]$;

$\}$

$\}$

return $*$this;

$\}$

template

void QueueForCS$2420$::push$\_$back$($const T& data$)\{$

if $($slots $!=0)$

$\{$

if $($slots $==$ capacity$)\{$

std::cout $$ "Error: Queue is full." $$ std::endl;

return;

arr$[$tail$]=$ data;

$++$tail;

$\}$

if $($tail $==$ capacity$)\{$

tail $=0$;

$\}$

$++$slots;

$\}$

if $($slots $==0)$

$\{$

$++$slots;

$\}$

$\}$

template

void QueueForCS$2420$::pop$\_$front$()\{$

if $($slots $==0)\{$

std::cout $$ "Error: Queue is empty." $$ std::endl;

return;

$\}$

$++$head;

if $($head $==$ capacity$)\{$

head $=0$;

$\}$

$--$slots;

$\}$

template

T QueueForCS$2420$::front$()$ const $\{$

if $($slots $==0)\{$

throw std::out$\_$of$\_$range$("$Error: Queue is empty."$)$;

$\}$

return arr$[$head$]$;

$\}$

template

T QueueForCS$2420$::back$()$ const $\{$

if $($slots $==0)\{$

throw std::out$\_$of$\_$range$("$Error: Queue is empty."$)$;

$\}$

$//$ If tail is at $0,$ the data is at index capacity $-1$

unsigned int tailIndex $=($tail $==0)?($capacity $-1)$ : $($tail $-1)$;

return arr$[$tailIndex$]$;

$\}$

template

unsigned int QueueForCS$2420$::size$()\{$

$/*$if $($slots $==0)$

$\{$

return slots $=4$;

$\}*/$

return slots;

$\}$

$//**********************************$

$//$Write your code above here

$//**********************************$