Let L be a language over a given alphabet Prove that L L LS

Let L be a language over a given alphabet. Prove that L+ = L L*

L+ means that we can have atleast one L or many L

i.e {L},{LL},{LLL},{LLLL},{LLLL...}

L* means that we can have 0 or more occurances of L

But L is follwed with L*

So it can accept {L},{LL},{LLL},{LLLL..}

As both accepts same alphabets L+=LL*