Binary Search Tree Class

Implement a function `binary_search_tree_sequence(operations: List[List]) -> List` that takes a list of operations to be performed on a single `BinarySearchTree` instance, and returns a list of results for each operation in the same order. Each operation is a list where the first element is the operation name, and optional following elements are arguments. - `['insert', value]` – insert an integer `value` into the BST. Duplicates are ignored. Returns `None`. - `['contains', target]` – return `True` if `target` is present, else `False`. - `['inorder']` – return a list of the tree's values in in-order (left, root, right) traversal order. You must also define a `BinarySearchTree` class with the following methods so that the sequence runner can use them: - `__init__(self)` – initializes an empty tree. - `insert(self, value: int) -> None` – inserts a new value, ignoring duplicates. - `contains(self, target: int) -> bool` – checks membership. - `inorder(self) -> List[int]` – returns in-order list. Your solution must not use any external libraries. All values are integers. The sequence runner should create a fresh `BinarySearchTree` for each call to `binary_search_tree_sequence`. For any operation that does not produce a result (insert), return `None` in the output list.

```python
binary_search_tree_sequence([
    ['insert', 5],
    ['insert', 3],
    ['insert', 7],
    ['insert', 3],
    ['contains', 3],
    ['contains', 4],
    ['inorder']
])
# Returns: [None, None, None, None, True, False, [3, 5, 7]]
```