Let be a finite alphabet and * be the set of words over . Define to mean there are *, such that . That is, holds iff u is a subword of v.

i) Prove ( *, ) is not a weak total order.

ii) does ( *, ) have a maximum element? why or why not?

' hc fin