Please prove a) and b) parts of the question. Thank you!

Let L be a non-empty language. Show that L C L2 if and only if e E L. That is, prove both a) Let L is a non-empty language. If e E L, then L C L2. b) Let L is a non-empty language. If L-L2, then E L. (Hint: Consider a string x in L that has minimal length.)