Write Python code to search and count how many nodes with element e in a singly linked list with a head indicator and discuss the algorithm's worst case running time complexity. def SLL: #- nested _Node class class_Node: def __init__(self, element, next): # initialize node's fields self._element element # reference to user's element self._next next # reference to next node def __init__(self): Create an empty link." self._head - None # reference to the head node self._size - 0 # number of the link elements Other parts of the SLL class are omitted def search_and_count(self, e): Your code goes here