Theory of Computation - Turing Machines

Problem 4. Combining TM programs Suppose you are given two TM programs for the TM simulator, M1 and M2. You have access to these programs but you know NOTHING about what these machines do. You only know that both machines always terminate; the first accepts some language L1, and the second L2 a) Describe how to use M1 and M2 to create a new program that will accept LI L2 b) Describe how to use M1 and M2 to create a new program that will accept Ll n L2 c) Describe how to use M1 to create a new program that will accept the complement of Ll