title: Kleene Star Undecidability
body: <p>I know that if L is decidable, we can prove that L* is also decidable by constructing  a Turing machine  but 
  I am having trouble solving this: 
  If  L is undecidable , then L* is also undecidable.
  Is this sentence true or false ? </p>