For the language L⊆{0,1}⋆, find a regular expression representing the following. You are required to provide the detailed steps or multiple cases that you used to derive your final answer:
i. All strings that do not begin with 11 .
ii. All strings in which every appearance of 0 is followed directly by a 1.