finite language

Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$

Give the regular expression over $${\left\{ {0,\,\,1} \right\}}$$ to denote the set of proper non-null substrings of the string $$0110$$.