Use Python for the following problem in the picture provided and provide comments

# This class represents a single node in the linked list

class Node:

# Constructor

def $\_\_$init$\_\_($self$,$ data, next$\_$node$)$:

# Each Node object keeps track of two things: the data it's holding,

# and a reference to the next node

self.data $=$ data

self.next$\_$node $=$ next$\_$node

# This class represents a linked list

class LinkedList:

# Constructor

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

# The list just needs to keep track of its head node. From there, we

# can get to anywhere else in the list!

self.head $=$ None

# The size attribute keeps track of how many nodes are in the list. We

# need to update this whenever nodes are added or removed.

self.size $=0$

# $\_\_$str$\_\_$ method

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

# This string stores the result to return

result $=$ 'head $->\text{'}$

# Traverse the list, starting from the head

temp $=$ self.head

while temp $!=$ None:

# Add the current node's data to the result

result $+=$ f$\text{'}\{$temp$.$data$\}->\text{'}$

# Advance temp to the next node in the list

temp $=$ temp.next$\_$node

result $+=$ 'None'

return result

# Returns the element at a certain $($non$-$negative$)$ index of the linked list

def get$($self$,$ index$)$:

# Make sure that the index is valid

if index self.size $-1$:

# Traverse the list to get to that index

temp $=$ self.head

for i in range$($index$)$:

temp $=$ temp.next$\_$node

# Return the data stored inside that node

return temp.data

else:

raise IndexError$($f$\text{'}$Invalid index provided, index must be between $0$ and $\{$self$.$size $-1\}\text{'})$

# Replaces the element at a certain $($non$-$negative$)$ index with a new value

def set$($self$,$ index, new$\_$data$)$:

# Make sure that the index is valid

if index self.size $-1$:

# Traverse the list to get to that index

temp $=$ self.head

for i in range$($index$)$:

temp $=$ temp.next$\_$node

# Update the data of that node with new$\_$data

temp.data $=$ new$\_$data

else:

raise IndexError$($f$\text{'}$Invalid index provided, index must be between $0$ and $\{$self$.$size $-1\}\text{'})$

# Adds new$\_$data to the head of the list

def add$\_$to$\_$head$($self$,$ new$\_$data$)$:

# Create a new node that contains new$\_$data. The new node's next points

# to the current head of the list.

new$\_$node $=$ Node$($new$\_$data, self.head$)$

# Update the list's head reference to point to the new node

self.head $=$ new$\_$node

# We could combine both actions above into a single line:

# self.head $=$ Node$($new$\_$data, self.head$)$

# Update the size attribute of the linked list

self.size $+=1$

# Adds new$\_$data at the specified index of the list

def add$($self$,$ new$\_$data, index$)$:

# If index is $0,$ call the previously written add$\_$to$\_$head method

if index $==0$:

self.add$\_$to$\_$head$($new$\_$data$)$

# Make sure that the index is valid. Valid indices $*$do$*$ include the

# size of the list, since that would be adding a new node at the end of

# the list.

elif $0$ index self.size:

# Get to the insertion point of the new node

temp $=$ self.head

for i in range$($index $-1)$:

temp $=$ temp.next$\_$node

# Create the new node, and change the list references to insert

# that node

new$\_$node $=$ Node$($new$\_$data, temp.next$\_$node$)$

temp.next$\_$node $=$ new$\_$node

# We could combine both actions above into a single line:

# temp.next$\_$node $=$ Node$($new$\_$data, temp.next$\_$node$)$

# Update the size attribute of the linked list

self.size $+=1$

else:

raise IndexError$($f$\text{'}$Invalid index provided, index must be between $0$ and $\{$self$.$size$\}\text{'})$

# Deletes the head node from the list, and returns the data that was deleted

def delete$\_$from$\_$head$($self$)$:

# Make sure the list isn't empty

if self.head $!=$ None:

temp $=$ self.head.data

self.head $=$ self.head.next$\_$node

self.size $-=1$

return temp

else:

# Handle this however desired $-$ probably should raise some kind of

# exception

pass