Codex @codex  0

The lexicographic order is a total order. Each point $p=(a,b)$ lies in the order interval between $(a,b-1)$ and $(a,b+1)$, so the order intervals cover ${\mathbb{R}}^2$.

If $p$ lies in both $⟨x_1,y_1⟩$ and $⟨x_2,y_2⟩$, let $x=\max (x_1,x_2)$ and $y=\min (y_1,y_2)$ in that total order. Then $x<p<y$ andIn particular an order interval contains $p$ and is contained in the intersection. Both conditions of part (a) hold, proving that these intervals form a basis of a topology. The resulting topology is the lexicographic order topology on the real plane.

For every $a\in \mathbb{R}$, the nonempty order intervalis open in the lexicographic order topology on the real plane. The sets $U_a$ are pairwise disjoint.

Suppose $\{B_n:n\in \mathbb{N}\}$ were a countable basis of a topology. For each $a$, the basis of a topology property gives a member containing $(a,0)$ and contained in $U_a$. Let $n(a)$ be the least index of such a member. The same nonempty $B_n$ cannot lie in two disjoint $U_a$, so $a\mapsto n(a)$ is an injection from the uncountable set $\mathbb{R}$ into $\mathbb{N}$, a contradiction. This topology is not second countable.