Consider the following languages over {0, 1}:

L₁ = {w : w begins and ends with the same symbols, |w| 3}

L₂ = {w : w = w^R, |w| 3}

Using the languages L₁ and L₂ enumerate the first 6 strings in the L-ordering of the following. If there are fewer than 7 string, enumerate the entire language:

a) Suff(L₂)

b) Pref(L₁)

c) h(L₁) where h(0) = ab and h(1) = c, = {a, b, c}