A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$.
Consider the set of all words (finite sequence of letters $a - z$), denoted by $W$, in dictionary order.
Answer -> E)well order
Minimal Element is 'a', it is less than all elements !
a) False, after aa, we can have ab. Then aba,abb,abc.. Not limited to 24
b) False. after aa, we can have ab,aba,abc.. In fact ab(a-z)*. Not limited to 2^{24}
C)False. Why not partial order ? Dictionary order is partial order ! It is Reflexive, Antysymmetric & Transitive. Even defination of wikipedia says it is !
D) False.Dictionary order is well order .
Defination of Dictionary order -> Ref -> https://en.wikipedia.org/wiki/Lexicographical_order
Given two partially ordered sets A and B, the lexicographical order on the Cartesian product A × B is defined as
3752 Points
2618 Points
2162 Points
1966 Points
1768 Points
1646 Points
1614 Points
1610 Points
1554 Points
1528 Points
Gatecse
The details for above can be read at the ...