Chains0

All problems in this problem set are about "chains": collections of nested ranges of integers. All problems are independent, but use the same definitions. Each problem statement contains the definitions it needs. If a term appears in multiple problems, the definition is always identical.

Definitions follow. The defined term is always in uppercase.

• An INTERVAL [x,y) with x <= y is the set of integers that are greater than or equal to x, and strictly less than y.
• There is only one EMPTY INTERVAL but it has multiple equivalent notations. For example, [0,0) and [3,3) both denote the empty interval. Note that [3,0) is not a valid interval, because an interval [x,y) must have x <= y.
• An interval I₁ is called a PROPER SUBSET of an interval I₂ if I₂ contains all elements of I₁ and at least one other element.

You are given the ints x and y. These represent a interval [x,y) that contains at least two numbers. Find any nonempty interval [a,b) that is a proper subset of [x,y).

Return the int[] {a, b}. That is, return a int[] with two elements, the first of which is your a and the second is your b. Any valid solution will be accepted.