[10 points Prove that the class of decidable languages is closed under Kleene star. Hint: Let Mi decide language A. Construct a new TM M to decide A* Recall that for string w to be in A*, there must be a division of w into k pieces w2wk for some k0 such that each wi E A. TM M will have to try all possible divisions for all values of k up to some number. If , think about which values of k the TM M needs to consider. This problem is tricky