input: Write a python function to detect and remove loop from a linked list.
  assert detect_and_remove_loop(Node(1)) == None
  assert detect_and_remove_loop(Node(2)) == None
  assert detect_and_remove_loop(Node(3)) == None
output: class Node:
      def __init__(self, data):
          self.data = data
          self.next = None
  
  def detect_and_remove_loop(head):
      if head is None or head.next is None:
          return None
  
      slow = head
      fast = head
  
      # Detect loop using Floyd's cycle-finding algorithm
      while fast and fast.next:
          slow = slow.next
          fast = fast.next.next
          if slow == fast:
              break
  
      # If loop exists
      if slow == fast:
          slow = head
          while slow.next != fast.next:
              slow = slow.next
              fast = fast.next
  
          # Remove loop
          fast.next = None
  
      return None