Given the class definition below, if you were to create a LinkedList object called my$\_$linked$\_$list, what would be the initial value of my$\_$linked$\_$list.head?

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

Node

True

data

None