Hello, I stuck with this exercise (Doh)

The kleene-closure of an Language L ist the smallest language, which contines L as subset and the empty word as an element and which is closend under concatenation. I have to profe by solving a-e

a) L $\displaystyle \subseteq$ L*

b) L* $\displaystyle \cdot$ L* $\displaystyle \subseteq$ L*

c) For every L' (over same Alphabet like L) with L $\displaystyle \subseteq$ L' , $\displaystyle \epsilon$ $\displaystyle \in$ L' and L' $\displaystyle \cdot$ L' $\displaystyle \subseteq$ L' obtains L* $\displaystyle \subseteq$ L'.

I think I solved a) by showing

L = {w1 | w1 $\displaystyle \in$ L} L*={w1,.....,wn | n $\displaystyle \in$ N, $\displaystyle w_i$ $\displaystyle \in$ L for all i = 1....n}

=> w1 $\displaystyle \in$ L and w1 $\displaystyle \in$L* => L $\displaystyle \subseteq$L*

b) and c) I stuck and any help will be appreciated (Clapping)