Implement FIFO queue using singly linked list in Python. Do NOT use built-in deque class in Python.

# implement using this signature. Add anything else necessary.

class Node: # Node for singly linked list def __init__(self, data): self.data=data self.next=None

class Queue(object):

def __init__(self):

pass

def enqueue(self, val:int) -> None:

# insert val to the queue

pass

def dequeue(self) -> int :

# remove and return the value from the queue

pass

def is_empty(self):

# return True if the queue is empty, otherwise return False

pass