Dataclass with slots

Define a class `Point` using `@dataclass` with the following requirements: - The dataclass must be **frozen** (immutable) and use **slots** (`slots=True`). - It should have two fields: `x` (int) and `y` (int), in that order. - The dataclass must be **orderable** by comparing the tuple `(x, y)` lexicographically. That is, a point `p1` is less than `p2` if `p1.x < p2.x` or (`p1.x == p2.x` and `p1.y < p2.y`). Implement the ordering by setting the `order=True` parameter of the dataclass decorator (do not manually define comparison methods). - Ensure that instances do **not** have an instance dictionary (`__dict__`). Because `slots=True` is used, `Point.__slots__` will contain the field names (`('x', 'y')`). Do not attempt to override `__slots__` manually. - Instance attributes must be accessible as `point.x` and `point.y`. Write the class definition exactly as specified. Do not add extra methods or attributes. The constructor must accept `x` and `y` as positional arguments in that order. Additionally, implement the following helper functions (they will be tested): - `make_point_1_2()` returns `[Point(1, 2).x, Point(1, 2).y]`. - `make_point_0_0()` returns `[Point(0, 0).x, Point(0, 0).y]`. - `make_point_neg_1_neg_2()` returns `[Point(-1, -2).x, Point(-1, -2).y]`. - `make_point_10_20()` returns `[Point(10, 20).x, Point(10, 20).y]`. Make sure all these functions are defined in your submitted code.

>>> p = Point(1, 2)
>>> p.x
1
>>> p.y
2
>>> Point(1, 2) == Point(1, 2)
True
>>> Point(1, 2) < Point(2, 0)
True
>>> Point(2, 0) < Point(1, 2)
False
>>> hasattr(p, '__dict__')
False
>>> make_point_1_2()
[1, 2]