I have these instructions: void remove$($const int index$).$ This method accepts an integer. The method should then traverse to and

delete the kth node in the list. This is zero based. Make sure to handle all scenarios $($empty list, one node, first

node, last node, and the general scenario$).$ Here is the code I've written, but it is not working correctly: $//$Remove

template

void DoublyLinkedList::remove$($const int index$)\{$

if $($index $<0)\{$

throw std::out$\_$of$\_$range$("$Error: Invalid index for removal."$)$;

$\}$

if $(!$this$->$head$)\{$

$//$ Empty list

throw std::out$\_$of$\_$range$("$Error: Cannot remove from an empty list."$)$;

$\}$

Node$*$ temp $=$ nullptr;

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

$//$ Removing the first node

temp $=$ this$->$head;

this$->$head $=$ this$->$head$->$next;

if $($this$->$head$)\{$

this$->$head$->$prev $=$ nullptr;

$\}$ else $\{$

$//$ If the list becomes empty after removal, update the tail

this$->$tail $=$ nullptr;

$\}$

$\}$ else $\{$

Node$*$ currentNode $=$ this$->$head;

int currentIndex $=0$;

while $($currentNode && currentIndex $<$ index$)\{$

currentNode $=$ currentNode$->$next;

currentIndex$++$;

$\}$

if $(!$currentNode$)\{$

throw std::out$\_$of$\_$range$("$Error: Index out of bounds."$)$;

$\}$

temp $=$ currentNode;

if $($currentNode$->$next$)\{$

currentNode$->$next$->$prev $=$ currentNode$->$prev;

$\}$ else $\{$

$//$ If removing the last node, update the tail

this$->$tail $=$ currentNode$->$prev;

$\}$

currentNode$->$prev$->$next $=$ currentNode$->$next;

$\}$

delete temp;

$\}.$ It is failing this test: $//$Test deleting a Kth element that doesn't exist.

d$->$remove$(500)$;

checkTest$($testNum$++,$ correct, $"1213",$ d$->$getListAsString$())$; $//13$

checkTest$($testNum$++,$ correct, $"1312",$ d$->$getListBackwardsAsString$())$; $//14.$ Thanks for any help.