Consider all finite letter-strings formed by using only two letters A and B. We consider the usual dictionary order on these strings.
Formal rule: To compare two strings $w_1$ and $w_2$, read them from left to right. We say ``$w_1$ is smaller than $w_2$'' or ``$w_1 < w_2$'' if the first letter in which $w_1$ and $w_2$ differ is A in $w_1$ and B in $w_2$ (for example, $\mathrm{ABAA} < \mathrm{ABB}$ by looking at the third letters) or if $w_2$ is obtained by appending some letters at the end of $w_1$ (e.g. $\mathrm{AB} < \mathrm{ABAA}$).
For each of the statements below, state if it is true or false. Write your answers as a sequence of three letters (T for True and F for False) in correct order.
(a) Let $w$ be an arbitrary string. There exists a unique string $y$ satisfying both the following properties: (i) $w < y$ and (ii) there is no string $x$ with $w < x < y$.
(b) It is possible to give an infinite decreasing sequence of strings, i.e. a sequence $w_1, w_2, \ldots$, such that $w_{i+1} < w_i$ for each positive integer $i$.
(c) Fewer than 50 strings are smaller than ABBABABB.