Implement FIFO queue using two stacks in Python. Methods should have O(1) time complexity. Stack: push() push operation, pop() remove and return value of top element, peek() return value of top element, is_empty() return true if stack empty, otherwise false

class TwoStacksQueue:

def __init__(self):

pass

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

pass

def dequeue(self) -> int:

pass

def is_empty(self) -> bool:

pass