Consider the following singly linked list data structure, implement a method find_middle() that finds and returns the middle element in the list. What is time complexity of your function?

class SinglyList: class _Node: def __init__(self, e, next): self._element = e self._next = next def __init__(self): self._head = self._tail = None self._size = 0 def find_middle(self):