Say you have a LinkedList object created via the definition below. What would happen if you called remove on the object, and the value of the node you asked to remove happened to be the head of the LinkedList?

class LinkedList:

$"""$

A linked list implementation of the List ADT

$"""$

def $\_\_$init$\_\_($self$)$:

self.head $=$ None

def add$($self$,$ val$)$:

$"""$

Adds a node containing val to the linked list

$"""$

if self.head is None: # If the list is empty

self.head $=$ Node$($val$)$

else:

current $=$ self.head

while current.next is not None:

current $=$ current.next

current.next $=$ Node$($val$)$

def display$($self$)$:

$"""$

Prints out the values in the linked list

$"""$

current $=$ self.head

while current is not None:

print$($current$.$data, end$="")$

current $=$ current.next

print$()$

def remove$($self$,$ val$)$:

$"""$

Removes the node containing val from the linked list

$"""$

if self.head is None: # If the list is empty

return

if self.head.data $==$ val: # If the node to remove is the head

self.head $=$ self.head.next

else:

current $=$ self.head

while current is not None and current.data $!=$ val:

previous $=$ current

current $=$ current.next

if current is not None: # If we found the value in the list

previous.next $=$ current.next

def is$\_$empty$($self$)$:

$"""$

Returns True if the linked list is empty,

returns False otherwise

$"""$

return self.head is None

Group of answer choices

The LinkedList would become lost in memory because its head was removed.

The function would change the value of every node in the LinkedList to the value of its next node, and the final node would get a value of None.

The target node would still be the head

The function would use the target node's "next" value as the new head of the list.