Chapter $7-$Programming Project: implement a singly linked list with following functions:

$-$ add$\_$head$($e$)$

$-$ add$\_$tail$($e$)$

$-$ find$\_3$rd$\_$to$\_$last$()-$ returns element located at third$-$to$-$last in the list

$-$ reverse$()-$ reverse the linked list, note, this is not just printing elements in reverse order, this is actually reversing the list

Use the base code in python below:

class Node:

$"""$

This class represents a node in a singly linked list.

Each node has a value and a reference to the next node in the list.

$"""$

def $\_\_$init$\_\_($self$,$ data$=$None$)$:

self.data $=$ data

self.next $=$ None

class SinglyLinkedList:

# Assignment: Programming Project, Chapter $7$

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

self.head $=$ None

self.tail $=$ None

def add$\_$head$($self$,$ e$)$:

$"""$

This function adds an element at the head of the list.

Parameters:

e $($Any$)$: The element to add.

Returns:

None

$"""$

# WRITE YOUR CODE HERE

def add$\_$tail$($self$,$ e$)$:

$"""$

This function adds an element at the tail of the list.

Parameters:

e $($Any$)$: The element to add.

Returns:

None

$"""$

# WRITE YOUR CODE HERE

def find$\_3$rd$\_$to$\_$last$($self$)$:

$"""$

This function finds the third$-$to$-$last element in the list.

Parameters:

None

Returns:

Any: The third$-$to$-$last element in the list, or None if the list has fewer than three elements.

$"""$

# WRITE YOUR CODE HERE

return None

def reverse$($self$)$:

$"""$

This function reverses the list.

Parameters:

None

Returns:

None

$"""$

# WRITE YOUR CODE HERE

if $\_\_$name$\_\_==\text{'}\_\_$main$\_\_\text{'}$:

linked$\_$list $=$ SinglyLinkedList$()$

linked$\_$list.add$\_$head$(1)$

linked$\_$list.add$\_$tail$(2)$

linked$\_$list.add$\_$tail$(3)$

linked$\_$list.add$\_$tail$(4)$

print$($linked$\_$list.find$\_3$rd$\_$to$\_$last$())$ # $2$

linked$\_$list.reverse$()$

print$($linked$\_$list.find$\_3$rd$\_$to$\_$last$())$ # $3$